/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:18:10,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:18:10,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:18:10,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:18:10,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:18:10,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:18:10,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:18:10,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:18:10,496 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:18:10,497 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:18:10,497 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:18:10,498 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:18:10,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:18:10,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:18:10,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:18:10,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:18:10,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:18:10,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:18:10,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:18:10,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:18:10,520 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:18:10,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:18:10,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:18:10,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:18:10,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:18:10,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:18:10,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:18:10,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:18:10,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:18:10,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:18:10,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:18:10,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:18:10,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:18:10,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:18:10,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:18:10,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:18:10,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:18:10,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:18:10,535 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:18:10,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:18:10,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:18:10,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:18:10,546 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 [2022-04-27 13:18:10,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:18:10,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:18:10,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:18:10,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:18:10,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:18:10,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:18:10,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:18:10,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:18:10,584 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:18:10,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:18:10,585 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:18:10,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:18:10,585 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:18:10,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:18:10,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:18:10,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:18:10,586 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:18:10,586 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:18:10,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:18:10,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:18:10,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:18:10,587 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:10,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:18:10,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:18:10,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:18:10,589 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:18:10,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:18:10,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:18:10,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:18:10,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:18:10,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:18:10,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:18:10,813 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:18:10,816 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:18:10,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-04-27 13:18:10,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a86ea08d/c8b2eb900ef14290b2762db67aff4b4f/FLAGfb66d7328 [2022-04-27 13:18:11,289 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:18:11,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-04-27 13:18:11,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a86ea08d/c8b2eb900ef14290b2762db67aff4b4f/FLAGfb66d7328 [2022-04-27 13:18:11,701 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a86ea08d/c8b2eb900ef14290b2762db67aff4b4f [2022-04-27 13:18:11,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:18:11,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:18:11,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:11,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:18:11,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:18:11,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1681dfd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11, skipping insertion in model container [2022-04-27 13:18:11,712 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:18:11,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:18:11,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-04-27 13:18:11,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:11,902 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:18:11,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-04-27 13:18:11,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:18:11,928 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:18:11,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11 WrapperNode [2022-04-27 13:18:11,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:18:11,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:18:11,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:18:11,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:18:11,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:18:11,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:18:11,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:18:11,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:18:11,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (1/1) ... [2022-04-27 13:18:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:18:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:11,984 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) [2022-04-27 13:18:12,006 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 [2022-04-27 13:18:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:18:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:18:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:18:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:18:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:18:12,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:18:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:18:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:18:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:18:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:18:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:18:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:18:12,096 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:18:12,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:18:12,256 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:18:12,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:18:12,266 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 13:18:12,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:12 BoogieIcfgContainer [2022-04-27 13:18:12,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:18:12,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:18:12,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:18:12,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:18:12,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:18:11" (1/3) ... [2022-04-27 13:18:12,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522a88d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:12, skipping insertion in model container [2022-04-27 13:18:12,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:18:11" (2/3) ... [2022-04-27 13:18:12,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522a88d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:18:12, skipping insertion in model container [2022-04-27 13:18:12,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:18:12" (3/3) ... [2022-04-27 13:18:12,280 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2022-04-27 13:18:12,291 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:18:12,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:18:12,328 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:18:12,333 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e27610b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2277e298 [2022-04-27 13:18:12,333 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:18:12,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 13:18:12,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 13:18:12,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:12,345 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:12,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:12,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:12,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-27 13:18:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:12,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101603969] [2022-04-27 13:18:12,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:12,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:12,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754840462] [2022-04-27 13:18:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:12,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:12,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:12,439 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) [2022-04-27 13:18:12,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:18:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:12,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-27 13:18:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:12,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:12,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-27 13:18:12,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-27 13:18:12,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-27 13:18:12,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-27 13:18:12,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-27 13:18:12,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-27 13:18:12,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-27 13:18:12,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-27 13:18:12,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:18:12,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:18:12,626 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-27 13:18:12,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {34#false} is VALID [2022-04-27 13:18:12,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:18:12,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-27 13:18:12,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-27 13:18:12,628 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-27 13:18:12,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-27 13:18:12,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-27 13:18:12,629 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34#false} is VALID [2022-04-27 13:18:12,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-27 13:18:12,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-27 13:18:12,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-27 13:18:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 13:18:12,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:18:12,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:12,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101603969] [2022-04-27 13:18:12,631 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:12,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754840462] [2022-04-27 13:18:12,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754840462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:12,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:12,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-27 13:18:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682008973] [2022-04-27 13:18:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:18:12,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:12,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:12,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-27 13:18:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:12,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-27 13:18:12,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:18:12,708 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:12,755 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-27 13:18:12,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-27 13:18:12,756 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-27 13:18:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:18:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-27 13:18:12,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-27 13:18:12,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:12,847 INFO L225 Difference]: With dead ends: 53 [2022-04-27 13:18:12,847 INFO L226 Difference]: Without dead ends: 25 [2022-04-27 13:18:12,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-27 13:18:12,852 INFO L413 NwaCegarLoop]: 34 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, 34 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 [2022-04-27 13:18:12,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-27 13:18:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-27 13:18:12,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:12,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:12,876 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:12,876 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:12,880 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:18:12,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:18:12,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:12,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:12,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:18:12,881 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-27 13:18:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:12,884 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 13:18:12,885 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:18:12,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:12,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:12,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:12,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-27 13:18:12,889 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-27 13:18:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:12,889 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-27 13:18:12,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-27 13:18:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:18:12,891 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:12,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:12,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:13,113 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 [2022-04-27 13:18:13,114 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-27 13:18:13,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:13,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315467421] [2022-04-27 13:18:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:13,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:13,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:13,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977477505] [2022-04-27 13:18:13,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:13,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:13,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:13,142 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) [2022-04-27 13:18:13,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:18:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:13,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:18:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:13,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:13,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 13:18:13,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,425 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,426 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,428 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {264#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:13,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {264#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {313#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:18:13,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {257#false} is VALID [2022-04-27 13:18:13,430 INFO L272 TraceCheckUtils]: 19: Hoare triple {257#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {257#false} is VALID [2022-04-27 13:18:13,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 13:18:13,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:18:13,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:18:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:13,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:18:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315467421] [2022-04-27 13:18:13,431 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:13,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977477505] [2022-04-27 13:18:13,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977477505] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:13,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:13,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:18:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670684513] [2022-04-27 13:18:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:13,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:18:13,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:13,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:13,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:13,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:18:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:13,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:18:13,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:18:13,464 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:13,541 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 13:18:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:18:13,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:18:13,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:18:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-27 13:18:13,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-27 13:18:13,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:13,594 INFO L225 Difference]: With dead ends: 34 [2022-04-27 13:18:13,594 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 13:18:13,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:18:13,598 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:13,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 13:18:13,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-27 13:18:13,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:13,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:13,609 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:13,610 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:13,615 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:18:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:18:13,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:13,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:13,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:18:13,618 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-27 13:18:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:13,621 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-27 13:18:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:18:13,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:13,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:13,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:13,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:13,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 13:18:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-27 13:18:13,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-27 13:18:13,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:13,629 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-27 13:18:13,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:18:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-27 13:18:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:18:13,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:13,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:13,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:13,843 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 [2022-04-27 13:18:13,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:13,844 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-27 13:18:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:13,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660960592] [2022-04-27 13:18:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:13,867 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:13,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592901172] [2022-04-27 13:18:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:13,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:13,870 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) [2022-04-27 13:18:13,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:18:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:13,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:18:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:13,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:14,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-27 13:18:14,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {469#true} is VALID [2022-04-27 13:18:14,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:18:14,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-27 13:18:14,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-27 13:18:14,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {469#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {469#true} is VALID [2022-04-27 13:18:14,768 INFO L272 TraceCheckUtils]: 6: Hoare triple {469#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {469#true} is VALID [2022-04-27 13:18:14,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:18:14,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:18:14,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:18:14,769 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-27 13:18:14,769 INFO L272 TraceCheckUtils]: 11: Hoare triple {469#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {469#true} is VALID [2022-04-27 13:18:14,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-27 13:18:14,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-27 13:18:14,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-27 13:18:14,770 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-27 13:18:16,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:18:16,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:18:16,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-27 13:18:18,758 WARN L272 TraceCheckUtils]: 19: Hoare triple {522#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {532#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-27 13:18:18,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:18,759 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-27 13:18:18,759 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-27 13:18:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:18,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:18:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:18,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660960592] [2022-04-27 13:18:18,760 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:18,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592901172] [2022-04-27 13:18:18,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592901172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:18:18,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:18:18,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:18:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270772197] [2022-04-27 13:18:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:18:18,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:18:18,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:18,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:18:20,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:20,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:18:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:20,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:18:20,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:18:20,063 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:18:23,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:18:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:23,191 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 13:18:23,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:18:23,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-27 13:18:23,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:18:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 13:18:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:18:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 13:18:23,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 13:18:24,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:24,547 INFO L225 Difference]: With dead ends: 37 [2022-04-27 13:18:24,547 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 13:18:24,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:18:24,548 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:24,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-04-27 13:18:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 13:18:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 13:18:24,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:24,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:24,564 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:24,564 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:24,566 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 13:18:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 13:18:24,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:24,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:24,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 13:18:24,567 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-27 13:18:24,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:24,569 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-27 13:18:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-27 13:18:24,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:24,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:24,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:24,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 13:18:24,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 13:18:24,574 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-27 13:18:24,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:24,575 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 13:18:24,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 13:18:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 13:18:24,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 13:18:24,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:24,578 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:24,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:24,787 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 [2022-04-27 13:18:24,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-27 13:18:24,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:24,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51248046] [2022-04-27 13:18:24,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:24,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139910671] [2022-04-27 13:18:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:24,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:24,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:24,814 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) [2022-04-27 13:18:24,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:18:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:24,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:18:24,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:24,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:25,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-27 13:18:25,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-27 13:18:25,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-27 13:18:25,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-27 13:18:25,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-27 13:18:25,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:25,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:25,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:25,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-27 13:18:25,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-27 13:18:25,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 50);havoc #t~post6; {712#true} is VALID [2022-04-27 13:18:25,075 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:25,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {777#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:25,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:25,079 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-27 13:18:25,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:18:25,081 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:25,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:25,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-27 13:18:25,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-27 13:18:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:25,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:25,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {713#false} assume !false; {713#false} is VALID [2022-04-27 13:18:25,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {713#false} is VALID [2022-04-27 13:18:25,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {796#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {800#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:18:25,571 INFO L272 TraceCheckUtils]: 25: Hoare triple {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {796#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:18:25,572 INFO L290 TraceCheckUtils]: 24: Hoare triple {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {792#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-27 13:18:25,575 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} {712#true} #63#return; {819#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-27 13:18:25,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:25,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:18:25,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {712#true} ~cond := #in~cond; {832#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:18:25,577 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#true} assume !!(#t~post6 < 50);havoc #t~post6; {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {712#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#true} is VALID [2022-04-27 13:18:25,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {712#true} {712#true} #61#return; {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:25,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:25,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {712#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {712#true} {712#true} #59#return; {712#true} is VALID [2022-04-27 13:18:25,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#true} assume !(0 == ~cond); {712#true} is VALID [2022-04-27 13:18:25,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {712#true} ~cond := #in~cond; {712#true} is VALID [2022-04-27 13:18:25,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {712#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {712#true} is VALID [2022-04-27 13:18:25,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {712#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {712#true} is VALID [2022-04-27 13:18:25,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {712#true} call #t~ret7 := main(); {712#true} is VALID [2022-04-27 13:18:25,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {712#true} {712#true} #67#return; {712#true} is VALID [2022-04-27 13:18:25,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {712#true} assume true; {712#true} is VALID [2022-04-27 13:18:25,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {712#true} is VALID [2022-04-27 13:18:25,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {712#true} call ULTIMATE.init(); {712#true} is VALID [2022-04-27 13:18:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:25,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:25,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51248046] [2022-04-27 13:18:25,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:25,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139910671] [2022-04-27 13:18:25,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139910671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:25,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:25,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-27 13:18:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144455598] [2022-04-27 13:18:25,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:25,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:18:25,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:25,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:25,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:25,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:18:25,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:25,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:18:25,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:18:25,619 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:25,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:25,982 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-27 13:18:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:18:25,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-27 13:18:25,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:25,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-27 13:18:25,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-27 13:18:26,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:26,032 INFO L225 Difference]: With dead ends: 39 [2022-04-27 13:18:26,032 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 13:18:26,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-27 13:18:26,033 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:26,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 115 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:26,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 13:18:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-27 13:18:26,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:26,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2022-04-27 13:18:26,045 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2022-04-27 13:18:26,045 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2022-04-27 13:18:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,047 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 13:18:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 13:18:26,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:26,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:26,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) Second operand 34 states. [2022-04-27 13:18:26,051 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) Second operand 34 states. [2022-04-27 13:18:26,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,053 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-27 13:18:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-27 13:18:26,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:26,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:26,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:26,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:26,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 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) [2022-04-27 13:18:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-27 13:18:26,055 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-27 13:18:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:26,055 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-27 13:18:26,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 13:18:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-27 13:18:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 13:18:26,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:26,056 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:26,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:26,256 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 [2022-04-27 13:18:26,256 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:26,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-27 13:18:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:26,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302630340] [2022-04-27 13:18:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:26,272 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:26,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1514411774] [2022-04-27 13:18:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:26,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:26,279 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) [2022-04-27 13:18:26,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:18:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:26,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:18:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:26,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:26,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-27 13:18:26,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#(<= ~counter~0 0)} {1066#true} #67#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#(<= ~counter~0 0)} call #t~ret7 := main(); {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,496 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #59#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,497 INFO L272 TraceCheckUtils]: 11: Hoare triple {1074#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {1074#(<= ~counter~0 0)} ~cond := #in~cond; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {1074#(<= ~counter~0 0)} assume !(0 == ~cond); {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#(<= ~counter~0 0)} assume true; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,498 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1074#(<= ~counter~0 0)} {1074#(<= ~counter~0 0)} #61#return; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1074#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:26,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {1074#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,502 INFO L272 TraceCheckUtils]: 19: Hoare triple {1123#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {1123#(<= ~counter~0 1)} ~cond := #in~cond; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,503 INFO L290 TraceCheckUtils]: 21: Hoare triple {1123#(<= ~counter~0 1)} assume !(0 == ~cond); {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(<= ~counter~0 1)} assume true; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,503 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1123#(<= ~counter~0 1)} {1123#(<= ~counter~0 1)} #63#return; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {1123#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {1123#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1123#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:26,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1151#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:18:26,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {1151#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1067#false} is VALID [2022-04-27 13:18:26,505 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1067#false} is VALID [2022-04-27 13:18:26,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-27 13:18:26,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-27 13:18:26,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-27 13:18:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:26,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:26,684 INFO L290 TraceCheckUtils]: 31: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-27 13:18:26,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {1067#false} assume 0 == ~cond; {1067#false} is VALID [2022-04-27 13:18:26,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {1067#false} ~cond := #in~cond; {1067#false} is VALID [2022-04-27 13:18:26,685 INFO L272 TraceCheckUtils]: 28: Hoare triple {1067#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1067#false} is VALID [2022-04-27 13:18:26,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {1179#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1067#false} is VALID [2022-04-27 13:18:26,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {1183#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1179#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:18:26,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {1183#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1183#(< ~counter~0 50)} is VALID [2022-04-27 13:18:26,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {1183#(< ~counter~0 50)} assume !!(0 != ~r~0); {1183#(< ~counter~0 50)} is VALID [2022-04-27 13:18:26,687 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1066#true} {1183#(< ~counter~0 50)} #63#return; {1183#(< ~counter~0 50)} is VALID [2022-04-27 13:18:26,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 13:18:26,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 13:18:26,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 13:18:26,687 INFO L272 TraceCheckUtils]: 19: Hoare triple {1183#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 13:18:26,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {1183#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1183#(< ~counter~0 50)} is VALID [2022-04-27 13:18:26,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1183#(< ~counter~0 50)} is VALID [2022-04-27 13:18:26,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {1211#(< ~counter~0 49)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,689 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1066#true} {1211#(< ~counter~0 49)} #61#return; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 13:18:26,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 13:18:26,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 13:18:26,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {1211#(< ~counter~0 49)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1066#true} is VALID [2022-04-27 13:18:26,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1066#true} {1211#(< ~counter~0 49)} #59#return; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-27 13:18:26,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 == ~cond); {1066#true} is VALID [2022-04-27 13:18:26,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} ~cond := #in~cond; {1066#true} is VALID [2022-04-27 13:18:26,690 INFO L272 TraceCheckUtils]: 6: Hoare triple {1211#(< ~counter~0 49)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1066#true} is VALID [2022-04-27 13:18:26,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#(< ~counter~0 49)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#(< ~counter~0 49)} call #t~ret7 := main(); {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#(< ~counter~0 49)} {1066#true} #67#return; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#(< ~counter~0 49)} assume true; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#(< ~counter~0 49)} is VALID [2022-04-27 13:18:26,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1066#true} is VALID [2022-04-27 13:18:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:26,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302630340] [2022-04-27 13:18:26,696 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:26,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514411774] [2022-04-27 13:18:26,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514411774] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:26,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:26,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:18:26,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494600996] [2022-04-27 13:18:26,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:26,697 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 13:18:26,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:26,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:26,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:26,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:18:26,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:26,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:18:26,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:18:26,744 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:26,955 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-27 13:18:26,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:18:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-27 13:18:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:18:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-27 13:18:26,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-27 13:18:27,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:27,019 INFO L225 Difference]: With dead ends: 61 [2022-04-27 13:18:27,019 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:18:27,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:18:27,020 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:27,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 128 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:18:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:18:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:18:27,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:27,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:27,049 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:27,050 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:27,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:27,052 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 13:18:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:27,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:27,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:27,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 13:18:27,053 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-27 13:18:27,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:27,055 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-27 13:18:27,055 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:27,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:27,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:27,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:27,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 13:18:27,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-27 13:18:27,058 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-27 13:18:27,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:27,058 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-27 13:18:27,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 13:18:27,059 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-27 13:18:27,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 13:18:27,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:27,060 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:27,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 13:18:27,279 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 [2022-04-27 13:18:27,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:27,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:27,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-27 13:18:27,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:27,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937732580] [2022-04-27 13:18:27,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:27,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:27,305 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:27,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025679211] [2022-04-27 13:18:27,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 13:18:27,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:27,307 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) [2022-04-27 13:18:27,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:18:27,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 13:18:27,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:27,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 13:18:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:27,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:27,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-27 13:18:27,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1554#(<= ~counter~0 0)} {1546#true} #67#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {1554#(<= ~counter~0 0)} call #t~ret7 := main(); {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1554#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,726 INFO L272 TraceCheckUtils]: 6: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,731 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #59#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,732 INFO L272 TraceCheckUtils]: 11: Hoare triple {1554#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1554#(<= ~counter~0 0)} ~cond := #in~cond; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {1554#(<= ~counter~0 0)} assume !(0 == ~cond); {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(<= ~counter~0 0)} assume true; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,733 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1554#(<= ~counter~0 0)} {1554#(<= ~counter~0 0)} #61#return; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {1554#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1554#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:27,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {1554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {1603#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,736 INFO L272 TraceCheckUtils]: 19: Hoare triple {1603#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {1603#(<= ~counter~0 1)} ~cond := #in~cond; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {1603#(<= ~counter~0 1)} assume !(0 == ~cond); {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {1603#(<= ~counter~0 1)} assume true; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,738 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1603#(<= ~counter~0 1)} {1603#(<= ~counter~0 1)} #63#return; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {1603#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {1603#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1603#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:27,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {1603#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,740 INFO L272 TraceCheckUtils]: 28: Hoare triple {1631#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#(<= ~counter~0 2)} ~cond := #in~cond; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,741 INFO L290 TraceCheckUtils]: 30: Hoare triple {1631#(<= ~counter~0 2)} assume !(0 == ~cond); {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {1631#(<= ~counter~0 2)} assume true; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,742 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1631#(<= ~counter~0 2)} {1631#(<= ~counter~0 2)} #63#return; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,742 INFO L290 TraceCheckUtils]: 33: Hoare triple {1631#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,743 INFO L290 TraceCheckUtils]: 34: Hoare triple {1631#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1631#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:27,743 INFO L290 TraceCheckUtils]: 35: Hoare triple {1631#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {1659#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,744 INFO L272 TraceCheckUtils]: 37: Hoare triple {1659#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {1659#(<= ~counter~0 3)} ~cond := #in~cond; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {1659#(<= ~counter~0 3)} assume !(0 == ~cond); {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {1659#(<= ~counter~0 3)} assume true; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,746 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1659#(<= ~counter~0 3)} {1659#(<= ~counter~0 3)} #63#return; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,746 INFO L290 TraceCheckUtils]: 42: Hoare triple {1659#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {1659#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1659#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:27,747 INFO L290 TraceCheckUtils]: 44: Hoare triple {1659#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,748 INFO L290 TraceCheckUtils]: 45: Hoare triple {1687#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,748 INFO L272 TraceCheckUtils]: 46: Hoare triple {1687#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {1687#(<= ~counter~0 4)} ~cond := #in~cond; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,749 INFO L290 TraceCheckUtils]: 48: Hoare triple {1687#(<= ~counter~0 4)} assume !(0 == ~cond); {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {1687#(<= ~counter~0 4)} assume true; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,750 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1687#(<= ~counter~0 4)} {1687#(<= ~counter~0 4)} #63#return; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,751 INFO L290 TraceCheckUtils]: 51: Hoare triple {1687#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {1687#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1687#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:27,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {1687#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1715#(<= |main_#t~post6| 4)} is VALID [2022-04-27 13:18:27,752 INFO L290 TraceCheckUtils]: 54: Hoare triple {1715#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {1547#false} is VALID [2022-04-27 13:18:27,752 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1547#false} is VALID [2022-04-27 13:18:27,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-27 13:18:27,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-27 13:18:27,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-27 13:18:27,753 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:27,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:28,112 INFO L290 TraceCheckUtils]: 58: Hoare triple {1547#false} assume !false; {1547#false} is VALID [2022-04-27 13:18:28,113 INFO L290 TraceCheckUtils]: 57: Hoare triple {1547#false} assume 0 == ~cond; {1547#false} is VALID [2022-04-27 13:18:28,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {1547#false} ~cond := #in~cond; {1547#false} is VALID [2022-04-27 13:18:28,113 INFO L272 TraceCheckUtils]: 55: Hoare triple {1547#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1547#false} is VALID [2022-04-27 13:18:28,114 INFO L290 TraceCheckUtils]: 54: Hoare triple {1743#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1547#false} is VALID [2022-04-27 13:18:28,115 INFO L290 TraceCheckUtils]: 53: Hoare triple {1747#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1743#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:18:28,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {1747#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1747#(< ~counter~0 50)} is VALID [2022-04-27 13:18:28,118 INFO L290 TraceCheckUtils]: 51: Hoare triple {1747#(< ~counter~0 50)} assume !!(0 != ~r~0); {1747#(< ~counter~0 50)} is VALID [2022-04-27 13:18:28,119 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1546#true} {1747#(< ~counter~0 50)} #63#return; {1747#(< ~counter~0 50)} is VALID [2022-04-27 13:18:28,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,119 INFO L272 TraceCheckUtils]: 46: Hoare triple {1747#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {1747#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1747#(< ~counter~0 50)} is VALID [2022-04-27 13:18:28,120 INFO L290 TraceCheckUtils]: 44: Hoare triple {1775#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1747#(< ~counter~0 50)} is VALID [2022-04-27 13:18:28,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {1775#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1775#(< ~counter~0 49)} is VALID [2022-04-27 13:18:28,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {1775#(< ~counter~0 49)} assume !!(0 != ~r~0); {1775#(< ~counter~0 49)} is VALID [2022-04-27 13:18:28,122 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1546#true} {1775#(< ~counter~0 49)} #63#return; {1775#(< ~counter~0 49)} is VALID [2022-04-27 13:18:28,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,122 INFO L290 TraceCheckUtils]: 38: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,122 INFO L272 TraceCheckUtils]: 37: Hoare triple {1775#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,122 INFO L290 TraceCheckUtils]: 36: Hoare triple {1775#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {1775#(< ~counter~0 49)} is VALID [2022-04-27 13:18:28,123 INFO L290 TraceCheckUtils]: 35: Hoare triple {1803#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1775#(< ~counter~0 49)} is VALID [2022-04-27 13:18:28,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1803#(< ~counter~0 48)} is VALID [2022-04-27 13:18:28,124 INFO L290 TraceCheckUtils]: 33: Hoare triple {1803#(< ~counter~0 48)} assume !!(0 != ~r~0); {1803#(< ~counter~0 48)} is VALID [2022-04-27 13:18:28,124 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1546#true} {1803#(< ~counter~0 48)} #63#return; {1803#(< ~counter~0 48)} is VALID [2022-04-27 13:18:28,124 INFO L290 TraceCheckUtils]: 31: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,125 INFO L272 TraceCheckUtils]: 28: Hoare triple {1803#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {1803#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {1803#(< ~counter~0 48)} is VALID [2022-04-27 13:18:28,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {1831#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1803#(< ~counter~0 48)} is VALID [2022-04-27 13:18:28,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {1831#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1831#(< ~counter~0 47)} is VALID [2022-04-27 13:18:28,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {1831#(< ~counter~0 47)} assume !!(0 != ~r~0); {1831#(< ~counter~0 47)} is VALID [2022-04-27 13:18:28,127 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1546#true} {1831#(< ~counter~0 47)} #63#return; {1831#(< ~counter~0 47)} is VALID [2022-04-27 13:18:28,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,127 INFO L272 TraceCheckUtils]: 19: Hoare triple {1831#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {1831#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {1831#(< ~counter~0 47)} is VALID [2022-04-27 13:18:28,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {1859#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1831#(< ~counter~0 47)} is VALID [2022-04-27 13:18:28,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {1859#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,129 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1546#true} {1859#(< ~counter~0 46)} #61#return; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,130 INFO L272 TraceCheckUtils]: 11: Hoare triple {1859#(< ~counter~0 46)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1546#true} {1859#(< ~counter~0 46)} #59#return; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1546#true} assume true; {1546#true} is VALID [2022-04-27 13:18:28,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {1546#true} assume !(0 == ~cond); {1546#true} is VALID [2022-04-27 13:18:28,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {1546#true} ~cond := #in~cond; {1546#true} is VALID [2022-04-27 13:18:28,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {1859#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1546#true} is VALID [2022-04-27 13:18:28,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {1859#(< ~counter~0 46)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {1859#(< ~counter~0 46)} call #t~ret7 := main(); {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1859#(< ~counter~0 46)} {1546#true} #67#return; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {1859#(< ~counter~0 46)} assume true; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {1546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1859#(< ~counter~0 46)} is VALID [2022-04-27 13:18:28,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {1546#true} call ULTIMATE.init(); {1546#true} is VALID [2022-04-27 13:18:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 13:18:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:28,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937732580] [2022-04-27 13:18:28,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:28,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025679211] [2022-04-27 13:18:28,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025679211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:28,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:28,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-27 13:18:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935106296] [2022-04-27 13:18:28,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:28,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 13:18:28,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:28,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:28,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:28,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 13:18:28,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:28,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 13:18:28,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 13:18:28,209 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:28,639 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-27 13:18:28,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-27 13:18:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-27 13:18:28,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:28,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 13:18:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-27 13:18:28,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-27 13:18:28,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:28,766 INFO L225 Difference]: With dead ends: 115 [2022-04-27 13:18:28,766 INFO L226 Difference]: Without dead ends: 110 [2022-04-27 13:18:28,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-27 13:18:28,767 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:28,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 142 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:18:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-27 13:18:28,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-27 13:18:28,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:28,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:28,805 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:28,806 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:28,810 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 13:18:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:28,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:28,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:28,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 13:18:28,811 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-27 13:18:28,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:28,814 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-27 13:18:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:28,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:28,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:28,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:28,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:18:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-27 13:18:28,828 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-27 13:18:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:28,828 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-27 13:18:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 13:18:28,828 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-27 13:18:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-27 13:18:28,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:28,829 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:28,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:29,055 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 [2022-04-27 13:18:29,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-27 13:18:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:29,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214921881] [2022-04-27 13:18:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:29,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:29,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:29,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139800900] [2022-04-27 13:18:29,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 13:18:29,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:29,096 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) [2022-04-27 13:18:29,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 13:18:31,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 13:18:31,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:31,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 13:18:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:31,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:31,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {2458#true} call ULTIMATE.init(); {2458#true} is VALID [2022-04-27 13:18:31,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {2458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2466#(<= ~counter~0 0)} {2458#true} #67#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {2466#(<= ~counter~0 0)} call #t~ret7 := main(); {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {2466#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {2466#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {2466#(<= ~counter~0 0)} ~cond := #in~cond; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {2466#(<= ~counter~0 0)} assume !(0 == ~cond); {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,896 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2466#(<= ~counter~0 0)} {2466#(<= ~counter~0 0)} #59#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,897 INFO L272 TraceCheckUtils]: 11: Hoare triple {2466#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {2466#(<= ~counter~0 0)} ~cond := #in~cond; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {2466#(<= ~counter~0 0)} assume !(0 == ~cond); {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {2466#(<= ~counter~0 0)} assume true; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,898 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2466#(<= ~counter~0 0)} {2466#(<= ~counter~0 0)} #61#return; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {2466#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2466#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:31,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {2466#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {2515#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {2515#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {2515#(<= ~counter~0 1)} ~cond := #in~cond; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {2515#(<= ~counter~0 1)} assume !(0 == ~cond); {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {2515#(<= ~counter~0 1)} assume true; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,907 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2515#(<= ~counter~0 1)} {2515#(<= ~counter~0 1)} #63#return; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {2515#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {2515#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2515#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:31,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {2515#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {2543#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,909 INFO L272 TraceCheckUtils]: 28: Hoare triple {2543#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {2543#(<= ~counter~0 2)} ~cond := #in~cond; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {2543#(<= ~counter~0 2)} assume !(0 == ~cond); {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {2543#(<= ~counter~0 2)} assume true; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,911 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2543#(<= ~counter~0 2)} {2543#(<= ~counter~0 2)} #63#return; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {2543#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {2543#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2543#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:31,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {2543#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {2571#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,913 INFO L272 TraceCheckUtils]: 37: Hoare triple {2571#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {2571#(<= ~counter~0 3)} ~cond := #in~cond; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {2571#(<= ~counter~0 3)} assume !(0 == ~cond); {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {2571#(<= ~counter~0 3)} assume true; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,915 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2571#(<= ~counter~0 3)} {2571#(<= ~counter~0 3)} #63#return; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {2571#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {2571#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2571#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:31,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {2571#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {2599#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,918 INFO L272 TraceCheckUtils]: 46: Hoare triple {2599#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {2599#(<= ~counter~0 4)} ~cond := #in~cond; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {2599#(<= ~counter~0 4)} assume !(0 == ~cond); {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {2599#(<= ~counter~0 4)} assume true; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,920 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2599#(<= ~counter~0 4)} {2599#(<= ~counter~0 4)} #63#return; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,920 INFO L290 TraceCheckUtils]: 51: Hoare triple {2599#(<= ~counter~0 4)} assume !!(0 != ~r~0); {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {2599#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2599#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:31,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {2599#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {2627#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,922 INFO L272 TraceCheckUtils]: 55: Hoare triple {2627#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {2627#(<= ~counter~0 5)} ~cond := #in~cond; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {2627#(<= ~counter~0 5)} assume !(0 == ~cond); {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {2627#(<= ~counter~0 5)} assume true; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2627#(<= ~counter~0 5)} {2627#(<= ~counter~0 5)} #63#return; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,925 INFO L290 TraceCheckUtils]: 60: Hoare triple {2627#(<= ~counter~0 5)} assume !!(0 != ~r~0); {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,925 INFO L290 TraceCheckUtils]: 61: Hoare triple {2627#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2627#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:31,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {2627#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,926 INFO L290 TraceCheckUtils]: 63: Hoare triple {2655#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,927 INFO L272 TraceCheckUtils]: 64: Hoare triple {2655#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,927 INFO L290 TraceCheckUtils]: 65: Hoare triple {2655#(<= ~counter~0 6)} ~cond := #in~cond; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,927 INFO L290 TraceCheckUtils]: 66: Hoare triple {2655#(<= ~counter~0 6)} assume !(0 == ~cond); {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,928 INFO L290 TraceCheckUtils]: 67: Hoare triple {2655#(<= ~counter~0 6)} assume true; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,929 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2655#(<= ~counter~0 6)} {2655#(<= ~counter~0 6)} #63#return; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {2655#(<= ~counter~0 6)} assume !!(0 != ~r~0); {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {2655#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2655#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:31,942 INFO L290 TraceCheckUtils]: 71: Hoare triple {2655#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,943 INFO L290 TraceCheckUtils]: 72: Hoare triple {2683#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,945 INFO L272 TraceCheckUtils]: 73: Hoare triple {2683#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,945 INFO L290 TraceCheckUtils]: 74: Hoare triple {2683#(<= ~counter~0 7)} ~cond := #in~cond; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,946 INFO L290 TraceCheckUtils]: 75: Hoare triple {2683#(<= ~counter~0 7)} assume !(0 == ~cond); {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,946 INFO L290 TraceCheckUtils]: 76: Hoare triple {2683#(<= ~counter~0 7)} assume true; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,947 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2683#(<= ~counter~0 7)} {2683#(<= ~counter~0 7)} #63#return; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,947 INFO L290 TraceCheckUtils]: 78: Hoare triple {2683#(<= ~counter~0 7)} assume !!(0 != ~r~0); {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {2683#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2683#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:31,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {2683#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,949 INFO L290 TraceCheckUtils]: 81: Hoare triple {2711#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,949 INFO L272 TraceCheckUtils]: 82: Hoare triple {2711#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,950 INFO L290 TraceCheckUtils]: 83: Hoare triple {2711#(<= ~counter~0 8)} ~cond := #in~cond; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,950 INFO L290 TraceCheckUtils]: 84: Hoare triple {2711#(<= ~counter~0 8)} assume !(0 == ~cond); {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,950 INFO L290 TraceCheckUtils]: 85: Hoare triple {2711#(<= ~counter~0 8)} assume true; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,951 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2711#(<= ~counter~0 8)} {2711#(<= ~counter~0 8)} #63#return; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,951 INFO L290 TraceCheckUtils]: 87: Hoare triple {2711#(<= ~counter~0 8)} assume !!(0 != ~r~0); {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,952 INFO L290 TraceCheckUtils]: 88: Hoare triple {2711#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2711#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:31,952 INFO L290 TraceCheckUtils]: 89: Hoare triple {2711#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,953 INFO L290 TraceCheckUtils]: 90: Hoare triple {2739#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,953 INFO L272 TraceCheckUtils]: 91: Hoare triple {2739#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,954 INFO L290 TraceCheckUtils]: 92: Hoare triple {2739#(<= ~counter~0 9)} ~cond := #in~cond; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,954 INFO L290 TraceCheckUtils]: 93: Hoare triple {2739#(<= ~counter~0 9)} assume !(0 == ~cond); {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,954 INFO L290 TraceCheckUtils]: 94: Hoare triple {2739#(<= ~counter~0 9)} assume true; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,955 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2739#(<= ~counter~0 9)} {2739#(<= ~counter~0 9)} #63#return; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,955 INFO L290 TraceCheckUtils]: 96: Hoare triple {2739#(<= ~counter~0 9)} assume !!(0 != ~r~0); {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {2739#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2739#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:31,956 INFO L290 TraceCheckUtils]: 98: Hoare triple {2739#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,956 INFO L290 TraceCheckUtils]: 99: Hoare triple {2767#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,957 INFO L272 TraceCheckUtils]: 100: Hoare triple {2767#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,957 INFO L290 TraceCheckUtils]: 101: Hoare triple {2767#(<= ~counter~0 10)} ~cond := #in~cond; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,958 INFO L290 TraceCheckUtils]: 102: Hoare triple {2767#(<= ~counter~0 10)} assume !(0 == ~cond); {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,958 INFO L290 TraceCheckUtils]: 103: Hoare triple {2767#(<= ~counter~0 10)} assume true; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,959 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2767#(<= ~counter~0 10)} {2767#(<= ~counter~0 10)} #63#return; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,959 INFO L290 TraceCheckUtils]: 105: Hoare triple {2767#(<= ~counter~0 10)} assume !!(0 != ~r~0); {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {2767#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2767#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:31,960 INFO L290 TraceCheckUtils]: 107: Hoare triple {2767#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2795#(<= |main_#t~post6| 10)} is VALID [2022-04-27 13:18:31,960 INFO L290 TraceCheckUtils]: 108: Hoare triple {2795#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {2459#false} is VALID [2022-04-27 13:18:31,960 INFO L272 TraceCheckUtils]: 109: Hoare triple {2459#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2459#false} is VALID [2022-04-27 13:18:31,960 INFO L290 TraceCheckUtils]: 110: Hoare triple {2459#false} ~cond := #in~cond; {2459#false} is VALID [2022-04-27 13:18:31,961 INFO L290 TraceCheckUtils]: 111: Hoare triple {2459#false} assume 0 == ~cond; {2459#false} is VALID [2022-04-27 13:18:31,961 INFO L290 TraceCheckUtils]: 112: Hoare triple {2459#false} assume !false; {2459#false} is VALID [2022-04-27 13:18:31,962 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:31,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:32,698 INFO L290 TraceCheckUtils]: 112: Hoare triple {2459#false} assume !false; {2459#false} is VALID [2022-04-27 13:18:32,698 INFO L290 TraceCheckUtils]: 111: Hoare triple {2459#false} assume 0 == ~cond; {2459#false} is VALID [2022-04-27 13:18:32,698 INFO L290 TraceCheckUtils]: 110: Hoare triple {2459#false} ~cond := #in~cond; {2459#false} is VALID [2022-04-27 13:18:32,698 INFO L272 TraceCheckUtils]: 109: Hoare triple {2459#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2459#false} is VALID [2022-04-27 13:18:32,698 INFO L290 TraceCheckUtils]: 108: Hoare triple {2823#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2459#false} is VALID [2022-04-27 13:18:32,699 INFO L290 TraceCheckUtils]: 107: Hoare triple {2827#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2823#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:18:32,699 INFO L290 TraceCheckUtils]: 106: Hoare triple {2827#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2827#(< ~counter~0 50)} is VALID [2022-04-27 13:18:32,699 INFO L290 TraceCheckUtils]: 105: Hoare triple {2827#(< ~counter~0 50)} assume !!(0 != ~r~0); {2827#(< ~counter~0 50)} is VALID [2022-04-27 13:18:32,700 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2458#true} {2827#(< ~counter~0 50)} #63#return; {2827#(< ~counter~0 50)} is VALID [2022-04-27 13:18:32,700 INFO L290 TraceCheckUtils]: 103: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,700 INFO L290 TraceCheckUtils]: 102: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,700 INFO L290 TraceCheckUtils]: 101: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,700 INFO L272 TraceCheckUtils]: 100: Hoare triple {2827#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,703 INFO L290 TraceCheckUtils]: 99: Hoare triple {2827#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2827#(< ~counter~0 50)} is VALID [2022-04-27 13:18:32,704 INFO L290 TraceCheckUtils]: 98: Hoare triple {2855#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2827#(< ~counter~0 50)} is VALID [2022-04-27 13:18:32,704 INFO L290 TraceCheckUtils]: 97: Hoare triple {2855#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2855#(< ~counter~0 49)} is VALID [2022-04-27 13:18:32,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {2855#(< ~counter~0 49)} assume !!(0 != ~r~0); {2855#(< ~counter~0 49)} is VALID [2022-04-27 13:18:32,705 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2458#true} {2855#(< ~counter~0 49)} #63#return; {2855#(< ~counter~0 49)} is VALID [2022-04-27 13:18:32,705 INFO L290 TraceCheckUtils]: 94: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,705 INFO L290 TraceCheckUtils]: 93: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,706 INFO L290 TraceCheckUtils]: 92: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,706 INFO L272 TraceCheckUtils]: 91: Hoare triple {2855#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,706 INFO L290 TraceCheckUtils]: 90: Hoare triple {2855#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2855#(< ~counter~0 49)} is VALID [2022-04-27 13:18:32,707 INFO L290 TraceCheckUtils]: 89: Hoare triple {2883#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2855#(< ~counter~0 49)} is VALID [2022-04-27 13:18:32,707 INFO L290 TraceCheckUtils]: 88: Hoare triple {2883#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2883#(< ~counter~0 48)} is VALID [2022-04-27 13:18:32,707 INFO L290 TraceCheckUtils]: 87: Hoare triple {2883#(< ~counter~0 48)} assume !!(0 != ~r~0); {2883#(< ~counter~0 48)} is VALID [2022-04-27 13:18:32,708 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2458#true} {2883#(< ~counter~0 48)} #63#return; {2883#(< ~counter~0 48)} is VALID [2022-04-27 13:18:32,708 INFO L290 TraceCheckUtils]: 85: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,708 INFO L290 TraceCheckUtils]: 84: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,708 INFO L290 TraceCheckUtils]: 83: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,708 INFO L272 TraceCheckUtils]: 82: Hoare triple {2883#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,709 INFO L290 TraceCheckUtils]: 81: Hoare triple {2883#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {2883#(< ~counter~0 48)} is VALID [2022-04-27 13:18:32,709 INFO L290 TraceCheckUtils]: 80: Hoare triple {2911#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2883#(< ~counter~0 48)} is VALID [2022-04-27 13:18:32,710 INFO L290 TraceCheckUtils]: 79: Hoare triple {2911#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2911#(< ~counter~0 47)} is VALID [2022-04-27 13:18:32,710 INFO L290 TraceCheckUtils]: 78: Hoare triple {2911#(< ~counter~0 47)} assume !!(0 != ~r~0); {2911#(< ~counter~0 47)} is VALID [2022-04-27 13:18:32,711 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2458#true} {2911#(< ~counter~0 47)} #63#return; {2911#(< ~counter~0 47)} is VALID [2022-04-27 13:18:32,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,711 INFO L290 TraceCheckUtils]: 75: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,711 INFO L290 TraceCheckUtils]: 74: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,711 INFO L272 TraceCheckUtils]: 73: Hoare triple {2911#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,711 INFO L290 TraceCheckUtils]: 72: Hoare triple {2911#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {2911#(< ~counter~0 47)} is VALID [2022-04-27 13:18:32,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {2939#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2911#(< ~counter~0 47)} is VALID [2022-04-27 13:18:32,712 INFO L290 TraceCheckUtils]: 70: Hoare triple {2939#(< ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2939#(< ~counter~0 46)} is VALID [2022-04-27 13:18:32,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {2939#(< ~counter~0 46)} assume !!(0 != ~r~0); {2939#(< ~counter~0 46)} is VALID [2022-04-27 13:18:32,713 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2458#true} {2939#(< ~counter~0 46)} #63#return; {2939#(< ~counter~0 46)} is VALID [2022-04-27 13:18:32,713 INFO L290 TraceCheckUtils]: 67: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,713 INFO L290 TraceCheckUtils]: 66: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,713 INFO L290 TraceCheckUtils]: 65: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,713 INFO L272 TraceCheckUtils]: 64: Hoare triple {2939#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,714 INFO L290 TraceCheckUtils]: 63: Hoare triple {2939#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {2939#(< ~counter~0 46)} is VALID [2022-04-27 13:18:32,714 INFO L290 TraceCheckUtils]: 62: Hoare triple {2967#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2939#(< ~counter~0 46)} is VALID [2022-04-27 13:18:32,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {2967#(< ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2967#(< ~counter~0 45)} is VALID [2022-04-27 13:18:32,715 INFO L290 TraceCheckUtils]: 60: Hoare triple {2967#(< ~counter~0 45)} assume !!(0 != ~r~0); {2967#(< ~counter~0 45)} is VALID [2022-04-27 13:18:32,716 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2458#true} {2967#(< ~counter~0 45)} #63#return; {2967#(< ~counter~0 45)} is VALID [2022-04-27 13:18:32,716 INFO L290 TraceCheckUtils]: 58: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,716 INFO L290 TraceCheckUtils]: 57: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,716 INFO L272 TraceCheckUtils]: 55: Hoare triple {2967#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,716 INFO L290 TraceCheckUtils]: 54: Hoare triple {2967#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {2967#(< ~counter~0 45)} is VALID [2022-04-27 13:18:32,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {2995#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2967#(< ~counter~0 45)} is VALID [2022-04-27 13:18:32,717 INFO L290 TraceCheckUtils]: 52: Hoare triple {2995#(< ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2995#(< ~counter~0 44)} is VALID [2022-04-27 13:18:32,718 INFO L290 TraceCheckUtils]: 51: Hoare triple {2995#(< ~counter~0 44)} assume !!(0 != ~r~0); {2995#(< ~counter~0 44)} is VALID [2022-04-27 13:18:32,718 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2458#true} {2995#(< ~counter~0 44)} #63#return; {2995#(< ~counter~0 44)} is VALID [2022-04-27 13:18:32,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,718 INFO L290 TraceCheckUtils]: 48: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,718 INFO L272 TraceCheckUtils]: 46: Hoare triple {2995#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {2995#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {2995#(< ~counter~0 44)} is VALID [2022-04-27 13:18:32,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {3023#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2995#(< ~counter~0 44)} is VALID [2022-04-27 13:18:32,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {3023#(< ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3023#(< ~counter~0 43)} is VALID [2022-04-27 13:18:32,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {3023#(< ~counter~0 43)} assume !!(0 != ~r~0); {3023#(< ~counter~0 43)} is VALID [2022-04-27 13:18:32,720 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2458#true} {3023#(< ~counter~0 43)} #63#return; {3023#(< ~counter~0 43)} is VALID [2022-04-27 13:18:32,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,721 INFO L272 TraceCheckUtils]: 37: Hoare triple {3023#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {3023#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {3023#(< ~counter~0 43)} is VALID [2022-04-27 13:18:32,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {3051#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3023#(< ~counter~0 43)} is VALID [2022-04-27 13:18:32,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {3051#(< ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3051#(< ~counter~0 42)} is VALID [2022-04-27 13:18:32,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {3051#(< ~counter~0 42)} assume !!(0 != ~r~0); {3051#(< ~counter~0 42)} is VALID [2022-04-27 13:18:32,723 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2458#true} {3051#(< ~counter~0 42)} #63#return; {3051#(< ~counter~0 42)} is VALID [2022-04-27 13:18:32,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,723 INFO L272 TraceCheckUtils]: 28: Hoare triple {3051#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {3051#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {3051#(< ~counter~0 42)} is VALID [2022-04-27 13:18:32,725 INFO L290 TraceCheckUtils]: 26: Hoare triple {3079#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3051#(< ~counter~0 42)} is VALID [2022-04-27 13:18:32,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {3079#(< ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3079#(< ~counter~0 41)} is VALID [2022-04-27 13:18:32,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {3079#(< ~counter~0 41)} assume !!(0 != ~r~0); {3079#(< ~counter~0 41)} is VALID [2022-04-27 13:18:32,726 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2458#true} {3079#(< ~counter~0 41)} #63#return; {3079#(< ~counter~0 41)} is VALID [2022-04-27 13:18:32,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,727 INFO L272 TraceCheckUtils]: 19: Hoare triple {3079#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {3079#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {3079#(< ~counter~0 41)} is VALID [2022-04-27 13:18:32,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {3107#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3079#(< ~counter~0 41)} is VALID [2022-04-27 13:18:32,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,729 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2458#true} {3107#(< ~counter~0 40)} #61#return; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,730 INFO L272 TraceCheckUtils]: 11: Hoare triple {3107#(< ~counter~0 40)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2458#true} {3107#(< ~counter~0 40)} #59#return; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#true} assume true; {2458#true} is VALID [2022-04-27 13:18:32,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#true} assume !(0 == ~cond); {2458#true} is VALID [2022-04-27 13:18:32,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#true} ~cond := #in~cond; {2458#true} is VALID [2022-04-27 13:18:32,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {3107#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2458#true} is VALID [2022-04-27 13:18:32,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {3107#(< ~counter~0 40)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {3107#(< ~counter~0 40)} call #t~ret7 := main(); {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3107#(< ~counter~0 40)} {2458#true} #67#return; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {3107#(< ~counter~0 40)} assume true; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {2458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3107#(< ~counter~0 40)} is VALID [2022-04-27 13:18:32,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {2458#true} call ULTIMATE.init(); {2458#true} is VALID [2022-04-27 13:18:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-27 13:18:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:32,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214921881] [2022-04-27 13:18:32,733 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:32,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139800900] [2022-04-27 13:18:32,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139800900] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:32,733 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:32,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-27 13:18:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91470546] [2022-04-27 13:18:32,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-04-27 13:18:32,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:32,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:18:32,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:32,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 13:18:32,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:32,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 13:18:32,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-27 13:18:32,882 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:18:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:33,956 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-04-27 13:18:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-27 13:18:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) Word has length 113 [2022-04-27 13:18:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:18:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-27 13:18:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:18:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-27 13:18:33,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 256 transitions. [2022-04-27 13:18:34,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:34,183 INFO L225 Difference]: With dead ends: 223 [2022-04-27 13:18:34,184 INFO L226 Difference]: Without dead ends: 218 [2022-04-27 13:18:34,184 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 [2022-04-27 13:18:34,185 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 292 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:34,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 296 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:18:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-27 13:18:34,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-27 13:18:34,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:34,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:18:34,260 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:18:34,260 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:18:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:34,267 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-27 13:18:34,268 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 13:18:34,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:34,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:34,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-27 13:18:34,269 INFO L87 Difference]: Start difference. First operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand 218 states. [2022-04-27 13:18:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:34,275 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-27 13:18:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 13:18:34,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:34,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:34,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:34,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 166 states have (on average 1.1385542168674698) internal successors, (189), 166 states have internal predecessors, (189), 27 states have call successors, (27), 26 states have call predecessors, (27), 24 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-27 13:18:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-27 13:18:34,283 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-27 13:18:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:34,283 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-27 13:18:34,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.153846153846154) internal successors, (134), 26 states have internal predecessors, (134), 24 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 22 states have call predecessors, (26), 23 states have call successors, (26) [2022-04-27 13:18:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-27 13:18:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-27 13:18:34,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:34,286 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:34,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:34,494 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 [2022-04-27 13:18:34,495 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:34,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1234385578, now seen corresponding path program 4 times [2022-04-27 13:18:34,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:34,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740221493] [2022-04-27 13:18:34,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:34,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:34,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:34,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [818089601] [2022-04-27 13:18:34,522 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 13:18:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:34,523 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) [2022-04-27 13:18:34,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 13:18:34,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 13:18:34,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:34,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-27 13:18:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:34,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:36,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {4234#true} call ULTIMATE.init(); {4234#true} is VALID [2022-04-27 13:18:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4242#(<= ~counter~0 0)} {4234#true} #67#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {4242#(<= ~counter~0 0)} call #t~ret7 := main(); {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {4242#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,229 INFO L272 TraceCheckUtils]: 6: Hoare triple {4242#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {4242#(<= ~counter~0 0)} ~cond := #in~cond; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {4242#(<= ~counter~0 0)} assume !(0 == ~cond); {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,230 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4242#(<= ~counter~0 0)} {4242#(<= ~counter~0 0)} #59#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,231 INFO L272 TraceCheckUtils]: 11: Hoare triple {4242#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {4242#(<= ~counter~0 0)} ~cond := #in~cond; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {4242#(<= ~counter~0 0)} assume !(0 == ~cond); {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {4242#(<= ~counter~0 0)} assume true; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4242#(<= ~counter~0 0)} {4242#(<= ~counter~0 0)} #61#return; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {4242#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4242#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:36,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {4242#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {4291#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,236 INFO L272 TraceCheckUtils]: 19: Hoare triple {4291#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {4291#(<= ~counter~0 1)} ~cond := #in~cond; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {4291#(<= ~counter~0 1)} assume !(0 == ~cond); {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {4291#(<= ~counter~0 1)} assume true; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,237 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4291#(<= ~counter~0 1)} {4291#(<= ~counter~0 1)} #63#return; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {4291#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {4291#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4291#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:36,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {4291#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {4319#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {4319#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {4319#(<= ~counter~0 2)} ~cond := #in~cond; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {4319#(<= ~counter~0 2)} assume !(0 == ~cond); {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {4319#(<= ~counter~0 2)} assume true; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,240 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4319#(<= ~counter~0 2)} {4319#(<= ~counter~0 2)} #63#return; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {4319#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,240 INFO L290 TraceCheckUtils]: 34: Hoare triple {4319#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4319#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:36,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {4319#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {4347#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,242 INFO L272 TraceCheckUtils]: 37: Hoare triple {4347#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,242 INFO L290 TraceCheckUtils]: 38: Hoare triple {4347#(<= ~counter~0 3)} ~cond := #in~cond; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {4347#(<= ~counter~0 3)} assume !(0 == ~cond); {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {4347#(<= ~counter~0 3)} assume true; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,243 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4347#(<= ~counter~0 3)} {4347#(<= ~counter~0 3)} #63#return; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {4347#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,243 INFO L290 TraceCheckUtils]: 43: Hoare triple {4347#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4347#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:36,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {4347#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {4375#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,245 INFO L272 TraceCheckUtils]: 46: Hoare triple {4375#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {4375#(<= ~counter~0 4)} ~cond := #in~cond; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {4375#(<= ~counter~0 4)} assume !(0 == ~cond); {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,245 INFO L290 TraceCheckUtils]: 49: Hoare triple {4375#(<= ~counter~0 4)} assume true; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,246 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4375#(<= ~counter~0 4)} {4375#(<= ~counter~0 4)} #63#return; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,246 INFO L290 TraceCheckUtils]: 51: Hoare triple {4375#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,246 INFO L290 TraceCheckUtils]: 52: Hoare triple {4375#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4375#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:36,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {4375#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {4403#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,248 INFO L272 TraceCheckUtils]: 55: Hoare triple {4403#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,248 INFO L290 TraceCheckUtils]: 56: Hoare triple {4403#(<= ~counter~0 5)} ~cond := #in~cond; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,248 INFO L290 TraceCheckUtils]: 57: Hoare triple {4403#(<= ~counter~0 5)} assume !(0 == ~cond); {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,248 INFO L290 TraceCheckUtils]: 58: Hoare triple {4403#(<= ~counter~0 5)} assume true; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,253 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4403#(<= ~counter~0 5)} {4403#(<= ~counter~0 5)} #63#return; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,254 INFO L290 TraceCheckUtils]: 60: Hoare triple {4403#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {4403#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4403#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:36,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {4403#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {4431#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,255 INFO L272 TraceCheckUtils]: 64: Hoare triple {4431#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {4431#(<= ~counter~0 6)} ~cond := #in~cond; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,256 INFO L290 TraceCheckUtils]: 66: Hoare triple {4431#(<= ~counter~0 6)} assume !(0 == ~cond); {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {4431#(<= ~counter~0 6)} assume true; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,256 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4431#(<= ~counter~0 6)} {4431#(<= ~counter~0 6)} #63#return; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,257 INFO L290 TraceCheckUtils]: 69: Hoare triple {4431#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,257 INFO L290 TraceCheckUtils]: 70: Hoare triple {4431#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4431#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:36,257 INFO L290 TraceCheckUtils]: 71: Hoare triple {4431#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,257 INFO L290 TraceCheckUtils]: 72: Hoare triple {4459#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,258 INFO L272 TraceCheckUtils]: 73: Hoare triple {4459#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,258 INFO L290 TraceCheckUtils]: 74: Hoare triple {4459#(<= ~counter~0 7)} ~cond := #in~cond; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,258 INFO L290 TraceCheckUtils]: 75: Hoare triple {4459#(<= ~counter~0 7)} assume !(0 == ~cond); {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,259 INFO L290 TraceCheckUtils]: 76: Hoare triple {4459#(<= ~counter~0 7)} assume true; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,259 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4459#(<= ~counter~0 7)} {4459#(<= ~counter~0 7)} #63#return; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {4459#(<= ~counter~0 7)} assume !!(0 != ~r~0); {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {4459#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4459#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:36,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {4459#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,261 INFO L290 TraceCheckUtils]: 81: Hoare triple {4487#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,261 INFO L272 TraceCheckUtils]: 82: Hoare triple {4487#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,261 INFO L290 TraceCheckUtils]: 83: Hoare triple {4487#(<= ~counter~0 8)} ~cond := #in~cond; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,262 INFO L290 TraceCheckUtils]: 84: Hoare triple {4487#(<= ~counter~0 8)} assume !(0 == ~cond); {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,262 INFO L290 TraceCheckUtils]: 85: Hoare triple {4487#(<= ~counter~0 8)} assume true; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,262 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4487#(<= ~counter~0 8)} {4487#(<= ~counter~0 8)} #63#return; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,263 INFO L290 TraceCheckUtils]: 87: Hoare triple {4487#(<= ~counter~0 8)} assume !!(0 != ~r~0); {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,263 INFO L290 TraceCheckUtils]: 88: Hoare triple {4487#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4487#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:36,263 INFO L290 TraceCheckUtils]: 89: Hoare triple {4487#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,264 INFO L290 TraceCheckUtils]: 90: Hoare triple {4515#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,264 INFO L272 TraceCheckUtils]: 91: Hoare triple {4515#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,264 INFO L290 TraceCheckUtils]: 92: Hoare triple {4515#(<= ~counter~0 9)} ~cond := #in~cond; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,265 INFO L290 TraceCheckUtils]: 93: Hoare triple {4515#(<= ~counter~0 9)} assume !(0 == ~cond); {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,265 INFO L290 TraceCheckUtils]: 94: Hoare triple {4515#(<= ~counter~0 9)} assume true; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,265 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4515#(<= ~counter~0 9)} {4515#(<= ~counter~0 9)} #63#return; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {4515#(<= ~counter~0 9)} assume !!(0 != ~r~0); {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,266 INFO L290 TraceCheckUtils]: 97: Hoare triple {4515#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4515#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:36,266 INFO L290 TraceCheckUtils]: 98: Hoare triple {4515#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,266 INFO L290 TraceCheckUtils]: 99: Hoare triple {4543#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,267 INFO L272 TraceCheckUtils]: 100: Hoare triple {4543#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,267 INFO L290 TraceCheckUtils]: 101: Hoare triple {4543#(<= ~counter~0 10)} ~cond := #in~cond; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,267 INFO L290 TraceCheckUtils]: 102: Hoare triple {4543#(<= ~counter~0 10)} assume !(0 == ~cond); {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,268 INFO L290 TraceCheckUtils]: 103: Hoare triple {4543#(<= ~counter~0 10)} assume true; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,268 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4543#(<= ~counter~0 10)} {4543#(<= ~counter~0 10)} #63#return; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,269 INFO L290 TraceCheckUtils]: 105: Hoare triple {4543#(<= ~counter~0 10)} assume !!(0 != ~r~0); {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,269 INFO L290 TraceCheckUtils]: 106: Hoare triple {4543#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4543#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:36,269 INFO L290 TraceCheckUtils]: 107: Hoare triple {4543#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,269 INFO L290 TraceCheckUtils]: 108: Hoare triple {4571#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,270 INFO L272 TraceCheckUtils]: 109: Hoare triple {4571#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,270 INFO L290 TraceCheckUtils]: 110: Hoare triple {4571#(<= ~counter~0 11)} ~cond := #in~cond; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,270 INFO L290 TraceCheckUtils]: 111: Hoare triple {4571#(<= ~counter~0 11)} assume !(0 == ~cond); {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,271 INFO L290 TraceCheckUtils]: 112: Hoare triple {4571#(<= ~counter~0 11)} assume true; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,276 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4571#(<= ~counter~0 11)} {4571#(<= ~counter~0 11)} #63#return; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,276 INFO L290 TraceCheckUtils]: 114: Hoare triple {4571#(<= ~counter~0 11)} assume !!(0 != ~r~0); {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,276 INFO L290 TraceCheckUtils]: 115: Hoare triple {4571#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4571#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:36,279 INFO L290 TraceCheckUtils]: 116: Hoare triple {4571#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,280 INFO L290 TraceCheckUtils]: 117: Hoare triple {4599#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,280 INFO L272 TraceCheckUtils]: 118: Hoare triple {4599#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,281 INFO L290 TraceCheckUtils]: 119: Hoare triple {4599#(<= ~counter~0 12)} ~cond := #in~cond; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,281 INFO L290 TraceCheckUtils]: 120: Hoare triple {4599#(<= ~counter~0 12)} assume !(0 == ~cond); {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,281 INFO L290 TraceCheckUtils]: 121: Hoare triple {4599#(<= ~counter~0 12)} assume true; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,282 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4599#(<= ~counter~0 12)} {4599#(<= ~counter~0 12)} #63#return; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,282 INFO L290 TraceCheckUtils]: 123: Hoare triple {4599#(<= ~counter~0 12)} assume !!(0 != ~r~0); {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,282 INFO L290 TraceCheckUtils]: 124: Hoare triple {4599#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4599#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:36,283 INFO L290 TraceCheckUtils]: 125: Hoare triple {4599#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,283 INFO L290 TraceCheckUtils]: 126: Hoare triple {4627#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,284 INFO L272 TraceCheckUtils]: 127: Hoare triple {4627#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,284 INFO L290 TraceCheckUtils]: 128: Hoare triple {4627#(<= ~counter~0 13)} ~cond := #in~cond; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,285 INFO L290 TraceCheckUtils]: 129: Hoare triple {4627#(<= ~counter~0 13)} assume !(0 == ~cond); {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,285 INFO L290 TraceCheckUtils]: 130: Hoare triple {4627#(<= ~counter~0 13)} assume true; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,286 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4627#(<= ~counter~0 13)} {4627#(<= ~counter~0 13)} #63#return; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,286 INFO L290 TraceCheckUtils]: 132: Hoare triple {4627#(<= ~counter~0 13)} assume !!(0 != ~r~0); {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,286 INFO L290 TraceCheckUtils]: 133: Hoare triple {4627#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4627#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:36,287 INFO L290 TraceCheckUtils]: 134: Hoare triple {4627#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,287 INFO L290 TraceCheckUtils]: 135: Hoare triple {4655#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,288 INFO L272 TraceCheckUtils]: 136: Hoare triple {4655#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,288 INFO L290 TraceCheckUtils]: 137: Hoare triple {4655#(<= ~counter~0 14)} ~cond := #in~cond; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,288 INFO L290 TraceCheckUtils]: 138: Hoare triple {4655#(<= ~counter~0 14)} assume !(0 == ~cond); {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,289 INFO L290 TraceCheckUtils]: 139: Hoare triple {4655#(<= ~counter~0 14)} assume true; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,289 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4655#(<= ~counter~0 14)} {4655#(<= ~counter~0 14)} #63#return; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,290 INFO L290 TraceCheckUtils]: 141: Hoare triple {4655#(<= ~counter~0 14)} assume !!(0 != ~r~0); {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,290 INFO L290 TraceCheckUtils]: 142: Hoare triple {4655#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4655#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:36,290 INFO L290 TraceCheckUtils]: 143: Hoare triple {4655#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,291 INFO L290 TraceCheckUtils]: 144: Hoare triple {4683#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,291 INFO L272 TraceCheckUtils]: 145: Hoare triple {4683#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,292 INFO L290 TraceCheckUtils]: 146: Hoare triple {4683#(<= ~counter~0 15)} ~cond := #in~cond; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,292 INFO L290 TraceCheckUtils]: 147: Hoare triple {4683#(<= ~counter~0 15)} assume !(0 == ~cond); {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,292 INFO L290 TraceCheckUtils]: 148: Hoare triple {4683#(<= ~counter~0 15)} assume true; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,293 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4683#(<= ~counter~0 15)} {4683#(<= ~counter~0 15)} #63#return; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,293 INFO L290 TraceCheckUtils]: 150: Hoare triple {4683#(<= ~counter~0 15)} assume !!(0 != ~r~0); {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,294 INFO L290 TraceCheckUtils]: 151: Hoare triple {4683#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4683#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:36,294 INFO L290 TraceCheckUtils]: 152: Hoare triple {4683#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,294 INFO L290 TraceCheckUtils]: 153: Hoare triple {4711#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,295 INFO L272 TraceCheckUtils]: 154: Hoare triple {4711#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,295 INFO L290 TraceCheckUtils]: 155: Hoare triple {4711#(<= ~counter~0 16)} ~cond := #in~cond; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,296 INFO L290 TraceCheckUtils]: 156: Hoare triple {4711#(<= ~counter~0 16)} assume !(0 == ~cond); {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,296 INFO L290 TraceCheckUtils]: 157: Hoare triple {4711#(<= ~counter~0 16)} assume true; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,297 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4711#(<= ~counter~0 16)} {4711#(<= ~counter~0 16)} #63#return; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,297 INFO L290 TraceCheckUtils]: 159: Hoare triple {4711#(<= ~counter~0 16)} assume !!(0 != ~r~0); {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,297 INFO L290 TraceCheckUtils]: 160: Hoare triple {4711#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4711#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:36,298 INFO L290 TraceCheckUtils]: 161: Hoare triple {4711#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,298 INFO L290 TraceCheckUtils]: 162: Hoare triple {4739#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,299 INFO L272 TraceCheckUtils]: 163: Hoare triple {4739#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,299 INFO L290 TraceCheckUtils]: 164: Hoare triple {4739#(<= ~counter~0 17)} ~cond := #in~cond; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,299 INFO L290 TraceCheckUtils]: 165: Hoare triple {4739#(<= ~counter~0 17)} assume !(0 == ~cond); {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,300 INFO L290 TraceCheckUtils]: 166: Hoare triple {4739#(<= ~counter~0 17)} assume true; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,301 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4739#(<= ~counter~0 17)} {4739#(<= ~counter~0 17)} #63#return; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,301 INFO L290 TraceCheckUtils]: 168: Hoare triple {4739#(<= ~counter~0 17)} assume !!(0 != ~r~0); {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,301 INFO L290 TraceCheckUtils]: 169: Hoare triple {4739#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4739#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:36,302 INFO L290 TraceCheckUtils]: 170: Hoare triple {4739#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,302 INFO L290 TraceCheckUtils]: 171: Hoare triple {4767#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,303 INFO L272 TraceCheckUtils]: 172: Hoare triple {4767#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,303 INFO L290 TraceCheckUtils]: 173: Hoare triple {4767#(<= ~counter~0 18)} ~cond := #in~cond; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,304 INFO L290 TraceCheckUtils]: 174: Hoare triple {4767#(<= ~counter~0 18)} assume !(0 == ~cond); {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,312 INFO L290 TraceCheckUtils]: 175: Hoare triple {4767#(<= ~counter~0 18)} assume true; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,313 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4767#(<= ~counter~0 18)} {4767#(<= ~counter~0 18)} #63#return; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,314 INFO L290 TraceCheckUtils]: 177: Hoare triple {4767#(<= ~counter~0 18)} assume !!(0 != ~r~0); {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,314 INFO L290 TraceCheckUtils]: 178: Hoare triple {4767#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4767#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:36,315 INFO L290 TraceCheckUtils]: 179: Hoare triple {4767#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,315 INFO L290 TraceCheckUtils]: 180: Hoare triple {4795#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,316 INFO L272 TraceCheckUtils]: 181: Hoare triple {4795#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,316 INFO L290 TraceCheckUtils]: 182: Hoare triple {4795#(<= ~counter~0 19)} ~cond := #in~cond; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,316 INFO L290 TraceCheckUtils]: 183: Hoare triple {4795#(<= ~counter~0 19)} assume !(0 == ~cond); {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,316 INFO L290 TraceCheckUtils]: 184: Hoare triple {4795#(<= ~counter~0 19)} assume true; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,317 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4795#(<= ~counter~0 19)} {4795#(<= ~counter~0 19)} #63#return; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,317 INFO L290 TraceCheckUtils]: 186: Hoare triple {4795#(<= ~counter~0 19)} assume !!(0 != ~r~0); {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,318 INFO L290 TraceCheckUtils]: 187: Hoare triple {4795#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4795#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:36,318 INFO L290 TraceCheckUtils]: 188: Hoare triple {4795#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,319 INFO L290 TraceCheckUtils]: 189: Hoare triple {4823#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,319 INFO L272 TraceCheckUtils]: 190: Hoare triple {4823#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,319 INFO L290 TraceCheckUtils]: 191: Hoare triple {4823#(<= ~counter~0 20)} ~cond := #in~cond; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,320 INFO L290 TraceCheckUtils]: 192: Hoare triple {4823#(<= ~counter~0 20)} assume !(0 == ~cond); {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,320 INFO L290 TraceCheckUtils]: 193: Hoare triple {4823#(<= ~counter~0 20)} assume true; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,320 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4823#(<= ~counter~0 20)} {4823#(<= ~counter~0 20)} #63#return; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,321 INFO L290 TraceCheckUtils]: 195: Hoare triple {4823#(<= ~counter~0 20)} assume !!(0 != ~r~0); {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,321 INFO L290 TraceCheckUtils]: 196: Hoare triple {4823#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4823#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:36,321 INFO L290 TraceCheckUtils]: 197: Hoare triple {4823#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,322 INFO L290 TraceCheckUtils]: 198: Hoare triple {4851#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,322 INFO L272 TraceCheckUtils]: 199: Hoare triple {4851#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,322 INFO L290 TraceCheckUtils]: 200: Hoare triple {4851#(<= ~counter~0 21)} ~cond := #in~cond; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,323 INFO L290 TraceCheckUtils]: 201: Hoare triple {4851#(<= ~counter~0 21)} assume !(0 == ~cond); {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,323 INFO L290 TraceCheckUtils]: 202: Hoare triple {4851#(<= ~counter~0 21)} assume true; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,323 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4851#(<= ~counter~0 21)} {4851#(<= ~counter~0 21)} #63#return; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,324 INFO L290 TraceCheckUtils]: 204: Hoare triple {4851#(<= ~counter~0 21)} assume !!(0 != ~r~0); {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,324 INFO L290 TraceCheckUtils]: 205: Hoare triple {4851#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4851#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:36,324 INFO L290 TraceCheckUtils]: 206: Hoare triple {4851#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,325 INFO L290 TraceCheckUtils]: 207: Hoare triple {4879#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,325 INFO L272 TraceCheckUtils]: 208: Hoare triple {4879#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,325 INFO L290 TraceCheckUtils]: 209: Hoare triple {4879#(<= ~counter~0 22)} ~cond := #in~cond; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,326 INFO L290 TraceCheckUtils]: 210: Hoare triple {4879#(<= ~counter~0 22)} assume !(0 == ~cond); {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,326 INFO L290 TraceCheckUtils]: 211: Hoare triple {4879#(<= ~counter~0 22)} assume true; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,326 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4879#(<= ~counter~0 22)} {4879#(<= ~counter~0 22)} #63#return; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,327 INFO L290 TraceCheckUtils]: 213: Hoare triple {4879#(<= ~counter~0 22)} assume !!(0 != ~r~0); {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,327 INFO L290 TraceCheckUtils]: 214: Hoare triple {4879#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4879#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:36,327 INFO L290 TraceCheckUtils]: 215: Hoare triple {4879#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4907#(<= |main_#t~post6| 22)} is VALID [2022-04-27 13:18:36,328 INFO L290 TraceCheckUtils]: 216: Hoare triple {4907#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {4235#false} is VALID [2022-04-27 13:18:36,328 INFO L272 TraceCheckUtils]: 217: Hoare triple {4235#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4235#false} is VALID [2022-04-27 13:18:36,328 INFO L290 TraceCheckUtils]: 218: Hoare triple {4235#false} ~cond := #in~cond; {4235#false} is VALID [2022-04-27 13:18:36,328 INFO L290 TraceCheckUtils]: 219: Hoare triple {4235#false} assume 0 == ~cond; {4235#false} is VALID [2022-04-27 13:18:36,328 INFO L290 TraceCheckUtils]: 220: Hoare triple {4235#false} assume !false; {4235#false} is VALID [2022-04-27 13:18:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:36,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:37,934 INFO L290 TraceCheckUtils]: 220: Hoare triple {4235#false} assume !false; {4235#false} is VALID [2022-04-27 13:18:37,934 INFO L290 TraceCheckUtils]: 219: Hoare triple {4235#false} assume 0 == ~cond; {4235#false} is VALID [2022-04-27 13:18:37,934 INFO L290 TraceCheckUtils]: 218: Hoare triple {4235#false} ~cond := #in~cond; {4235#false} is VALID [2022-04-27 13:18:37,934 INFO L272 TraceCheckUtils]: 217: Hoare triple {4235#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4235#false} is VALID [2022-04-27 13:18:37,934 INFO L290 TraceCheckUtils]: 216: Hoare triple {4935#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {4235#false} is VALID [2022-04-27 13:18:37,934 INFO L290 TraceCheckUtils]: 215: Hoare triple {4939#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4935#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:18:37,935 INFO L290 TraceCheckUtils]: 214: Hoare triple {4939#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4939#(< ~counter~0 50)} is VALID [2022-04-27 13:18:37,935 INFO L290 TraceCheckUtils]: 213: Hoare triple {4939#(< ~counter~0 50)} assume !!(0 != ~r~0); {4939#(< ~counter~0 50)} is VALID [2022-04-27 13:18:37,936 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4234#true} {4939#(< ~counter~0 50)} #63#return; {4939#(< ~counter~0 50)} is VALID [2022-04-27 13:18:37,936 INFO L290 TraceCheckUtils]: 211: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,936 INFO L290 TraceCheckUtils]: 210: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,936 INFO L290 TraceCheckUtils]: 209: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,936 INFO L272 TraceCheckUtils]: 208: Hoare triple {4939#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,936 INFO L290 TraceCheckUtils]: 207: Hoare triple {4939#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4939#(< ~counter~0 50)} is VALID [2022-04-27 13:18:37,936 INFO L290 TraceCheckUtils]: 206: Hoare triple {4967#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4939#(< ~counter~0 50)} is VALID [2022-04-27 13:18:37,937 INFO L290 TraceCheckUtils]: 205: Hoare triple {4967#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4967#(< ~counter~0 49)} is VALID [2022-04-27 13:18:37,937 INFO L290 TraceCheckUtils]: 204: Hoare triple {4967#(< ~counter~0 49)} assume !!(0 != ~r~0); {4967#(< ~counter~0 49)} is VALID [2022-04-27 13:18:37,938 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4234#true} {4967#(< ~counter~0 49)} #63#return; {4967#(< ~counter~0 49)} is VALID [2022-04-27 13:18:37,938 INFO L290 TraceCheckUtils]: 202: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,938 INFO L290 TraceCheckUtils]: 201: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,938 INFO L290 TraceCheckUtils]: 200: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,938 INFO L272 TraceCheckUtils]: 199: Hoare triple {4967#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,938 INFO L290 TraceCheckUtils]: 198: Hoare triple {4967#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4967#(< ~counter~0 49)} is VALID [2022-04-27 13:18:37,938 INFO L290 TraceCheckUtils]: 197: Hoare triple {4995#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4967#(< ~counter~0 49)} is VALID [2022-04-27 13:18:37,939 INFO L290 TraceCheckUtils]: 196: Hoare triple {4995#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4995#(< ~counter~0 48)} is VALID [2022-04-27 13:18:37,939 INFO L290 TraceCheckUtils]: 195: Hoare triple {4995#(< ~counter~0 48)} assume !!(0 != ~r~0); {4995#(< ~counter~0 48)} is VALID [2022-04-27 13:18:37,939 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4234#true} {4995#(< ~counter~0 48)} #63#return; {4995#(< ~counter~0 48)} is VALID [2022-04-27 13:18:37,940 INFO L290 TraceCheckUtils]: 193: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,940 INFO L290 TraceCheckUtils]: 192: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,940 INFO L290 TraceCheckUtils]: 191: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,940 INFO L272 TraceCheckUtils]: 190: Hoare triple {4995#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,940 INFO L290 TraceCheckUtils]: 189: Hoare triple {4995#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {4995#(< ~counter~0 48)} is VALID [2022-04-27 13:18:37,940 INFO L290 TraceCheckUtils]: 188: Hoare triple {5023#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4995#(< ~counter~0 48)} is VALID [2022-04-27 13:18:37,941 INFO L290 TraceCheckUtils]: 187: Hoare triple {5023#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5023#(< ~counter~0 47)} is VALID [2022-04-27 13:18:37,941 INFO L290 TraceCheckUtils]: 186: Hoare triple {5023#(< ~counter~0 47)} assume !!(0 != ~r~0); {5023#(< ~counter~0 47)} is VALID [2022-04-27 13:18:37,941 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4234#true} {5023#(< ~counter~0 47)} #63#return; {5023#(< ~counter~0 47)} is VALID [2022-04-27 13:18:37,941 INFO L290 TraceCheckUtils]: 184: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,941 INFO L290 TraceCheckUtils]: 183: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,941 INFO L290 TraceCheckUtils]: 182: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,942 INFO L272 TraceCheckUtils]: 181: Hoare triple {5023#(< ~counter~0 47)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,942 INFO L290 TraceCheckUtils]: 180: Hoare triple {5023#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {5023#(< ~counter~0 47)} is VALID [2022-04-27 13:18:37,942 INFO L290 TraceCheckUtils]: 179: Hoare triple {5051#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5023#(< ~counter~0 47)} is VALID [2022-04-27 13:18:37,942 INFO L290 TraceCheckUtils]: 178: Hoare triple {5051#(< ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5051#(< ~counter~0 46)} is VALID [2022-04-27 13:18:37,943 INFO L290 TraceCheckUtils]: 177: Hoare triple {5051#(< ~counter~0 46)} assume !!(0 != ~r~0); {5051#(< ~counter~0 46)} is VALID [2022-04-27 13:18:37,943 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4234#true} {5051#(< ~counter~0 46)} #63#return; {5051#(< ~counter~0 46)} is VALID [2022-04-27 13:18:37,943 INFO L290 TraceCheckUtils]: 175: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,943 INFO L290 TraceCheckUtils]: 174: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,943 INFO L290 TraceCheckUtils]: 173: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,943 INFO L272 TraceCheckUtils]: 172: Hoare triple {5051#(< ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,944 INFO L290 TraceCheckUtils]: 171: Hoare triple {5051#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {5051#(< ~counter~0 46)} is VALID [2022-04-27 13:18:37,944 INFO L290 TraceCheckUtils]: 170: Hoare triple {5079#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5051#(< ~counter~0 46)} is VALID [2022-04-27 13:18:37,944 INFO L290 TraceCheckUtils]: 169: Hoare triple {5079#(< ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5079#(< ~counter~0 45)} is VALID [2022-04-27 13:18:37,945 INFO L290 TraceCheckUtils]: 168: Hoare triple {5079#(< ~counter~0 45)} assume !!(0 != ~r~0); {5079#(< ~counter~0 45)} is VALID [2022-04-27 13:18:37,945 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4234#true} {5079#(< ~counter~0 45)} #63#return; {5079#(< ~counter~0 45)} is VALID [2022-04-27 13:18:37,945 INFO L290 TraceCheckUtils]: 166: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,945 INFO L290 TraceCheckUtils]: 165: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,945 INFO L290 TraceCheckUtils]: 164: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,945 INFO L272 TraceCheckUtils]: 163: Hoare triple {5079#(< ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,946 INFO L290 TraceCheckUtils]: 162: Hoare triple {5079#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {5079#(< ~counter~0 45)} is VALID [2022-04-27 13:18:37,946 INFO L290 TraceCheckUtils]: 161: Hoare triple {5107#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5079#(< ~counter~0 45)} is VALID [2022-04-27 13:18:37,946 INFO L290 TraceCheckUtils]: 160: Hoare triple {5107#(< ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5107#(< ~counter~0 44)} is VALID [2022-04-27 13:18:37,947 INFO L290 TraceCheckUtils]: 159: Hoare triple {5107#(< ~counter~0 44)} assume !!(0 != ~r~0); {5107#(< ~counter~0 44)} is VALID [2022-04-27 13:18:37,947 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4234#true} {5107#(< ~counter~0 44)} #63#return; {5107#(< ~counter~0 44)} is VALID [2022-04-27 13:18:37,947 INFO L290 TraceCheckUtils]: 157: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,947 INFO L290 TraceCheckUtils]: 156: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,947 INFO L290 TraceCheckUtils]: 155: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,947 INFO L272 TraceCheckUtils]: 154: Hoare triple {5107#(< ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,947 INFO L290 TraceCheckUtils]: 153: Hoare triple {5107#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {5107#(< ~counter~0 44)} is VALID [2022-04-27 13:18:37,948 INFO L290 TraceCheckUtils]: 152: Hoare triple {5135#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5107#(< ~counter~0 44)} is VALID [2022-04-27 13:18:37,948 INFO L290 TraceCheckUtils]: 151: Hoare triple {5135#(< ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5135#(< ~counter~0 43)} is VALID [2022-04-27 13:18:37,948 INFO L290 TraceCheckUtils]: 150: Hoare triple {5135#(< ~counter~0 43)} assume !!(0 != ~r~0); {5135#(< ~counter~0 43)} is VALID [2022-04-27 13:18:37,949 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4234#true} {5135#(< ~counter~0 43)} #63#return; {5135#(< ~counter~0 43)} is VALID [2022-04-27 13:18:37,949 INFO L290 TraceCheckUtils]: 148: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,949 INFO L290 TraceCheckUtils]: 147: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,949 INFO L290 TraceCheckUtils]: 146: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,949 INFO L272 TraceCheckUtils]: 145: Hoare triple {5135#(< ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,949 INFO L290 TraceCheckUtils]: 144: Hoare triple {5135#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {5135#(< ~counter~0 43)} is VALID [2022-04-27 13:18:37,950 INFO L290 TraceCheckUtils]: 143: Hoare triple {5163#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5135#(< ~counter~0 43)} is VALID [2022-04-27 13:18:37,950 INFO L290 TraceCheckUtils]: 142: Hoare triple {5163#(< ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5163#(< ~counter~0 42)} is VALID [2022-04-27 13:18:37,950 INFO L290 TraceCheckUtils]: 141: Hoare triple {5163#(< ~counter~0 42)} assume !!(0 != ~r~0); {5163#(< ~counter~0 42)} is VALID [2022-04-27 13:18:37,951 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4234#true} {5163#(< ~counter~0 42)} #63#return; {5163#(< ~counter~0 42)} is VALID [2022-04-27 13:18:37,951 INFO L290 TraceCheckUtils]: 139: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,951 INFO L290 TraceCheckUtils]: 138: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,951 INFO L290 TraceCheckUtils]: 137: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,951 INFO L272 TraceCheckUtils]: 136: Hoare triple {5163#(< ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,951 INFO L290 TraceCheckUtils]: 135: Hoare triple {5163#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {5163#(< ~counter~0 42)} is VALID [2022-04-27 13:18:37,952 INFO L290 TraceCheckUtils]: 134: Hoare triple {5191#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5163#(< ~counter~0 42)} is VALID [2022-04-27 13:18:37,952 INFO L290 TraceCheckUtils]: 133: Hoare triple {5191#(< ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5191#(< ~counter~0 41)} is VALID [2022-04-27 13:18:37,952 INFO L290 TraceCheckUtils]: 132: Hoare triple {5191#(< ~counter~0 41)} assume !!(0 != ~r~0); {5191#(< ~counter~0 41)} is VALID [2022-04-27 13:18:37,953 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4234#true} {5191#(< ~counter~0 41)} #63#return; {5191#(< ~counter~0 41)} is VALID [2022-04-27 13:18:37,953 INFO L290 TraceCheckUtils]: 130: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,953 INFO L290 TraceCheckUtils]: 129: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,953 INFO L290 TraceCheckUtils]: 128: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,953 INFO L272 TraceCheckUtils]: 127: Hoare triple {5191#(< ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,953 INFO L290 TraceCheckUtils]: 126: Hoare triple {5191#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {5191#(< ~counter~0 41)} is VALID [2022-04-27 13:18:37,954 INFO L290 TraceCheckUtils]: 125: Hoare triple {5219#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5191#(< ~counter~0 41)} is VALID [2022-04-27 13:18:37,954 INFO L290 TraceCheckUtils]: 124: Hoare triple {5219#(< ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5219#(< ~counter~0 40)} is VALID [2022-04-27 13:18:37,954 INFO L290 TraceCheckUtils]: 123: Hoare triple {5219#(< ~counter~0 40)} assume !!(0 != ~r~0); {5219#(< ~counter~0 40)} is VALID [2022-04-27 13:18:37,955 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4234#true} {5219#(< ~counter~0 40)} #63#return; {5219#(< ~counter~0 40)} is VALID [2022-04-27 13:18:37,955 INFO L290 TraceCheckUtils]: 121: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,955 INFO L290 TraceCheckUtils]: 120: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,955 INFO L290 TraceCheckUtils]: 119: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,955 INFO L272 TraceCheckUtils]: 118: Hoare triple {5219#(< ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,955 INFO L290 TraceCheckUtils]: 117: Hoare triple {5219#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {5219#(< ~counter~0 40)} is VALID [2022-04-27 13:18:37,955 INFO L290 TraceCheckUtils]: 116: Hoare triple {5247#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5219#(< ~counter~0 40)} is VALID [2022-04-27 13:18:37,956 INFO L290 TraceCheckUtils]: 115: Hoare triple {5247#(< ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5247#(< ~counter~0 39)} is VALID [2022-04-27 13:18:37,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {5247#(< ~counter~0 39)} assume !!(0 != ~r~0); {5247#(< ~counter~0 39)} is VALID [2022-04-27 13:18:37,956 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4234#true} {5247#(< ~counter~0 39)} #63#return; {5247#(< ~counter~0 39)} is VALID [2022-04-27 13:18:37,957 INFO L290 TraceCheckUtils]: 112: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,957 INFO L290 TraceCheckUtils]: 111: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,957 INFO L290 TraceCheckUtils]: 110: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,957 INFO L272 TraceCheckUtils]: 109: Hoare triple {5247#(< ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,957 INFO L290 TraceCheckUtils]: 108: Hoare triple {5247#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {5247#(< ~counter~0 39)} is VALID [2022-04-27 13:18:37,957 INFO L290 TraceCheckUtils]: 107: Hoare triple {5275#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5247#(< ~counter~0 39)} is VALID [2022-04-27 13:18:37,958 INFO L290 TraceCheckUtils]: 106: Hoare triple {5275#(< ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5275#(< ~counter~0 38)} is VALID [2022-04-27 13:18:37,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {5275#(< ~counter~0 38)} assume !!(0 != ~r~0); {5275#(< ~counter~0 38)} is VALID [2022-04-27 13:18:37,958 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4234#true} {5275#(< ~counter~0 38)} #63#return; {5275#(< ~counter~0 38)} is VALID [2022-04-27 13:18:37,959 INFO L290 TraceCheckUtils]: 103: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,959 INFO L290 TraceCheckUtils]: 102: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,959 INFO L272 TraceCheckUtils]: 100: Hoare triple {5275#(< ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,959 INFO L290 TraceCheckUtils]: 99: Hoare triple {5275#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {5275#(< ~counter~0 38)} is VALID [2022-04-27 13:18:37,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {5303#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5275#(< ~counter~0 38)} is VALID [2022-04-27 13:18:37,960 INFO L290 TraceCheckUtils]: 97: Hoare triple {5303#(< ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5303#(< ~counter~0 37)} is VALID [2022-04-27 13:18:37,960 INFO L290 TraceCheckUtils]: 96: Hoare triple {5303#(< ~counter~0 37)} assume !!(0 != ~r~0); {5303#(< ~counter~0 37)} is VALID [2022-04-27 13:18:37,960 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4234#true} {5303#(< ~counter~0 37)} #63#return; {5303#(< ~counter~0 37)} is VALID [2022-04-27 13:18:37,960 INFO L290 TraceCheckUtils]: 94: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,960 INFO L290 TraceCheckUtils]: 93: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,960 INFO L290 TraceCheckUtils]: 92: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,961 INFO L272 TraceCheckUtils]: 91: Hoare triple {5303#(< ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,961 INFO L290 TraceCheckUtils]: 90: Hoare triple {5303#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {5303#(< ~counter~0 37)} is VALID [2022-04-27 13:18:37,961 INFO L290 TraceCheckUtils]: 89: Hoare triple {5331#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5303#(< ~counter~0 37)} is VALID [2022-04-27 13:18:37,961 INFO L290 TraceCheckUtils]: 88: Hoare triple {5331#(< ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5331#(< ~counter~0 36)} is VALID [2022-04-27 13:18:37,962 INFO L290 TraceCheckUtils]: 87: Hoare triple {5331#(< ~counter~0 36)} assume !!(0 != ~r~0); {5331#(< ~counter~0 36)} is VALID [2022-04-27 13:18:37,962 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4234#true} {5331#(< ~counter~0 36)} #63#return; {5331#(< ~counter~0 36)} is VALID [2022-04-27 13:18:37,962 INFO L290 TraceCheckUtils]: 85: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,962 INFO L290 TraceCheckUtils]: 84: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,962 INFO L290 TraceCheckUtils]: 83: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,962 INFO L272 TraceCheckUtils]: 82: Hoare triple {5331#(< ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {5331#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {5331#(< ~counter~0 36)} is VALID [2022-04-27 13:18:37,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {5359#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5331#(< ~counter~0 36)} is VALID [2022-04-27 13:18:37,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {5359#(< ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5359#(< ~counter~0 35)} is VALID [2022-04-27 13:18:37,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {5359#(< ~counter~0 35)} assume !!(0 != ~r~0); {5359#(< ~counter~0 35)} is VALID [2022-04-27 13:18:37,964 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4234#true} {5359#(< ~counter~0 35)} #63#return; {5359#(< ~counter~0 35)} is VALID [2022-04-27 13:18:37,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,964 INFO L272 TraceCheckUtils]: 73: Hoare triple {5359#(< ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,965 INFO L290 TraceCheckUtils]: 72: Hoare triple {5359#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {5359#(< ~counter~0 35)} is VALID [2022-04-27 13:18:37,965 INFO L290 TraceCheckUtils]: 71: Hoare triple {5387#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5359#(< ~counter~0 35)} is VALID [2022-04-27 13:18:37,965 INFO L290 TraceCheckUtils]: 70: Hoare triple {5387#(< ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5387#(< ~counter~0 34)} is VALID [2022-04-27 13:18:37,966 INFO L290 TraceCheckUtils]: 69: Hoare triple {5387#(< ~counter~0 34)} assume !!(0 != ~r~0); {5387#(< ~counter~0 34)} is VALID [2022-04-27 13:18:37,966 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4234#true} {5387#(< ~counter~0 34)} #63#return; {5387#(< ~counter~0 34)} is VALID [2022-04-27 13:18:37,966 INFO L290 TraceCheckUtils]: 67: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,966 INFO L290 TraceCheckUtils]: 66: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,966 INFO L290 TraceCheckUtils]: 65: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,966 INFO L272 TraceCheckUtils]: 64: Hoare triple {5387#(< ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,966 INFO L290 TraceCheckUtils]: 63: Hoare triple {5387#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {5387#(< ~counter~0 34)} is VALID [2022-04-27 13:18:37,967 INFO L290 TraceCheckUtils]: 62: Hoare triple {5415#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5387#(< ~counter~0 34)} is VALID [2022-04-27 13:18:37,967 INFO L290 TraceCheckUtils]: 61: Hoare triple {5415#(< ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5415#(< ~counter~0 33)} is VALID [2022-04-27 13:18:37,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {5415#(< ~counter~0 33)} assume !!(0 != ~r~0); {5415#(< ~counter~0 33)} is VALID [2022-04-27 13:18:37,968 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4234#true} {5415#(< ~counter~0 33)} #63#return; {5415#(< ~counter~0 33)} is VALID [2022-04-27 13:18:37,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,968 INFO L272 TraceCheckUtils]: 55: Hoare triple {5415#(< ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {5415#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {5415#(< ~counter~0 33)} is VALID [2022-04-27 13:18:37,969 INFO L290 TraceCheckUtils]: 53: Hoare triple {5443#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5415#(< ~counter~0 33)} is VALID [2022-04-27 13:18:37,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {5443#(< ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5443#(< ~counter~0 32)} is VALID [2022-04-27 13:18:37,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {5443#(< ~counter~0 32)} assume !!(0 != ~r~0); {5443#(< ~counter~0 32)} is VALID [2022-04-27 13:18:37,970 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4234#true} {5443#(< ~counter~0 32)} #63#return; {5443#(< ~counter~0 32)} is VALID [2022-04-27 13:18:37,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,970 INFO L272 TraceCheckUtils]: 46: Hoare triple {5443#(< ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {5443#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {5443#(< ~counter~0 32)} is VALID [2022-04-27 13:18:37,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {5471#(< ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5443#(< ~counter~0 32)} is VALID [2022-04-27 13:18:37,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {5471#(< ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5471#(< ~counter~0 31)} is VALID [2022-04-27 13:18:37,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {5471#(< ~counter~0 31)} assume !!(0 != ~r~0); {5471#(< ~counter~0 31)} is VALID [2022-04-27 13:18:37,972 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4234#true} {5471#(< ~counter~0 31)} #63#return; {5471#(< ~counter~0 31)} is VALID [2022-04-27 13:18:37,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,972 INFO L272 TraceCheckUtils]: 37: Hoare triple {5471#(< ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {5471#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {5471#(< ~counter~0 31)} is VALID [2022-04-27 13:18:37,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {5499#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5471#(< ~counter~0 31)} is VALID [2022-04-27 13:18:37,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {5499#(< ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5499#(< ~counter~0 30)} is VALID [2022-04-27 13:18:37,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {5499#(< ~counter~0 30)} assume !!(0 != ~r~0); {5499#(< ~counter~0 30)} is VALID [2022-04-27 13:18:37,974 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4234#true} {5499#(< ~counter~0 30)} #63#return; {5499#(< ~counter~0 30)} is VALID [2022-04-27 13:18:37,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,974 INFO L272 TraceCheckUtils]: 28: Hoare triple {5499#(< ~counter~0 30)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {5499#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {5499#(< ~counter~0 30)} is VALID [2022-04-27 13:18:37,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {5527#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5499#(< ~counter~0 30)} is VALID [2022-04-27 13:18:37,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {5527#(< ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5527#(< ~counter~0 29)} is VALID [2022-04-27 13:18:37,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {5527#(< ~counter~0 29)} assume !!(0 != ~r~0); {5527#(< ~counter~0 29)} is VALID [2022-04-27 13:18:37,975 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4234#true} {5527#(< ~counter~0 29)} #63#return; {5527#(< ~counter~0 29)} is VALID [2022-04-27 13:18:37,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,976 INFO L272 TraceCheckUtils]: 19: Hoare triple {5527#(< ~counter~0 29)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {5527#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {5527#(< ~counter~0 29)} is VALID [2022-04-27 13:18:37,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {5555#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5527#(< ~counter~0 29)} is VALID [2022-04-27 13:18:37,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {5555#(< ~counter~0 28)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,985 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4234#true} {5555#(< ~counter~0 28)} #61#return; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,985 INFO L272 TraceCheckUtils]: 11: Hoare triple {5555#(< ~counter~0 28)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4234#true} {5555#(< ~counter~0 28)} #59#return; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {4234#true} assume true; {4234#true} is VALID [2022-04-27 13:18:37,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {4234#true} assume !(0 == ~cond); {4234#true} is VALID [2022-04-27 13:18:37,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {4234#true} ~cond := #in~cond; {4234#true} is VALID [2022-04-27 13:18:37,987 INFO L272 TraceCheckUtils]: 6: Hoare triple {5555#(< ~counter~0 28)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4234#true} is VALID [2022-04-27 13:18:37,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {5555#(< ~counter~0 28)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {5555#(< ~counter~0 28)} call #t~ret7 := main(); {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5555#(< ~counter~0 28)} {4234#true} #67#return; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {5555#(< ~counter~0 28)} assume true; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {4234#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5555#(< ~counter~0 28)} is VALID [2022-04-27 13:18:37,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {4234#true} call ULTIMATE.init(); {4234#true} is VALID [2022-04-27 13:18:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-04-27 13:18:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740221493] [2022-04-27 13:18:37,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:37,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818089601] [2022-04-27 13:18:37,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818089601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:37,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:37,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-27 13:18:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13164926] [2022-04-27 13:18:37,995 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:37,996 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-04-27 13:18:37,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:18:37,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:18:38,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 368 edges. 368 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:38,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 13:18:38,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:18:38,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 13:18:38,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 13:18:38,249 INFO L87 Difference]: Start difference. First operand 218 states and 241 transitions. Second operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:18:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:41,066 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-27 13:18:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-27 13:18:41,067 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) Word has length 221 [2022-04-27 13:18:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:18:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:18:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-27 13:18:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:18:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-27 13:18:41,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 508 transitions. [2022-04-27 13:18:41,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:18:41,561 INFO L225 Difference]: With dead ends: 439 [2022-04-27 13:18:41,561 INFO L226 Difference]: Without dead ends: 434 [2022-04-27 13:18:41,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-27 13:18:41,564 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 724 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:18:41,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 448 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 13:18:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-27 13:18:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-27 13:18:41,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:18:41,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:18:41,697 INFO L74 IsIncluded]: Start isIncluded. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:18:41,697 INFO L87 Difference]: Start difference. First operand 434 states. Second operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:18:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:41,712 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-27 13:18:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 13:18:41,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:41,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:41,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-27 13:18:41,715 INFO L87 Difference]: Start difference. First operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand 434 states. [2022-04-27 13:18:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:18:41,729 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-27 13:18:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 13:18:41,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:18:41,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:18:41,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:18:41,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:18:41,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.1407185628742516) internal successors, (381), 334 states have internal predecessors, (381), 51 states have call successors, (51), 50 states have call predecessors, (51), 48 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 13:18:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-27 13:18:41,747 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-27 13:18:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:18:41,747 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-27 13:18:41,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.32) internal successors, (266), 50 states have internal predecessors, (266), 48 states have call successors, (52), 26 states have call predecessors, (52), 25 states have return successors, (50), 46 states have call predecessors, (50), 47 states have call successors, (50) [2022-04-27 13:18:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-27 13:18:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-27 13:18:41,755 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:18:41,755 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:18:41,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 13:18:41,971 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 [2022-04-27 13:18:41,971 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:18:41,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:18:41,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1876588118, now seen corresponding path program 5 times [2022-04-27 13:18:41,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:18:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087421795] [2022-04-27 13:18:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:18:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:18:42,013 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:18:42,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1866728098] [2022-04-27 13:18:42,014 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 13:18:42,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:18:42,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:18:42,015 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) [2022-04-27 13:18:42,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 13:18:44,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 13:18:44,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 13:18:44,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-27 13:18:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:18:44,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:18:47,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {7738#true} call ULTIMATE.init(); {7738#true} is VALID [2022-04-27 13:18:47,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7746#(<= ~counter~0 0)} {7738#true} #67#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {7746#(<= ~counter~0 0)} call #t~ret7 := main(); {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {7746#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,157 INFO L272 TraceCheckUtils]: 6: Hoare triple {7746#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {7746#(<= ~counter~0 0)} ~cond := #in~cond; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {7746#(<= ~counter~0 0)} assume !(0 == ~cond); {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,159 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7746#(<= ~counter~0 0)} {7746#(<= ~counter~0 0)} #59#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,159 INFO L272 TraceCheckUtils]: 11: Hoare triple {7746#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {7746#(<= ~counter~0 0)} ~cond := #in~cond; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {7746#(<= ~counter~0 0)} assume !(0 == ~cond); {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {7746#(<= ~counter~0 0)} assume true; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7746#(<= ~counter~0 0)} {7746#(<= ~counter~0 0)} #61#return; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {7746#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7746#(<= ~counter~0 0)} is VALID [2022-04-27 13:18:47,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {7746#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {7795#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {7795#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {7795#(<= ~counter~0 1)} ~cond := #in~cond; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {7795#(<= ~counter~0 1)} assume !(0 == ~cond); {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,175 INFO L290 TraceCheckUtils]: 22: Hoare triple {7795#(<= ~counter~0 1)} assume true; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,176 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7795#(<= ~counter~0 1)} {7795#(<= ~counter~0 1)} #63#return; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {7795#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {7795#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7795#(<= ~counter~0 1)} is VALID [2022-04-27 13:18:47,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {7795#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {7823#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,178 INFO L272 TraceCheckUtils]: 28: Hoare triple {7823#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {7823#(<= ~counter~0 2)} ~cond := #in~cond; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {7823#(<= ~counter~0 2)} assume !(0 == ~cond); {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {7823#(<= ~counter~0 2)} assume true; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,179 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7823#(<= ~counter~0 2)} {7823#(<= ~counter~0 2)} #63#return; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {7823#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {7823#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7823#(<= ~counter~0 2)} is VALID [2022-04-27 13:18:47,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {7823#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {7851#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,181 INFO L272 TraceCheckUtils]: 37: Hoare triple {7851#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {7851#(<= ~counter~0 3)} ~cond := #in~cond; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,182 INFO L290 TraceCheckUtils]: 39: Hoare triple {7851#(<= ~counter~0 3)} assume !(0 == ~cond); {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {7851#(<= ~counter~0 3)} assume true; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,185 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7851#(<= ~counter~0 3)} {7851#(<= ~counter~0 3)} #63#return; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {7851#(<= ~counter~0 3)} assume !!(0 != ~r~0); {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {7851#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:47,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {7851#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {7879#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,187 INFO L272 TraceCheckUtils]: 46: Hoare triple {7879#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,187 INFO L290 TraceCheckUtils]: 47: Hoare triple {7879#(<= ~counter~0 4)} ~cond := #in~cond; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {7879#(<= ~counter~0 4)} assume !(0 == ~cond); {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {7879#(<= ~counter~0 4)} assume true; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,188 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7879#(<= ~counter~0 4)} {7879#(<= ~counter~0 4)} #63#return; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {7879#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {7879#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:47,189 INFO L290 TraceCheckUtils]: 53: Hoare triple {7879#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {7907#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,190 INFO L272 TraceCheckUtils]: 55: Hoare triple {7907#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {7907#(<= ~counter~0 5)} ~cond := #in~cond; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,191 INFO L290 TraceCheckUtils]: 57: Hoare triple {7907#(<= ~counter~0 5)} assume !(0 == ~cond); {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {7907#(<= ~counter~0 5)} assume true; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,192 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7907#(<= ~counter~0 5)} {7907#(<= ~counter~0 5)} #63#return; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,192 INFO L290 TraceCheckUtils]: 60: Hoare triple {7907#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,193 INFO L290 TraceCheckUtils]: 61: Hoare triple {7907#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:47,193 INFO L290 TraceCheckUtils]: 62: Hoare triple {7907#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,193 INFO L290 TraceCheckUtils]: 63: Hoare triple {7935#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,194 INFO L272 TraceCheckUtils]: 64: Hoare triple {7935#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {7935#(<= ~counter~0 6)} ~cond := #in~cond; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,195 INFO L290 TraceCheckUtils]: 66: Hoare triple {7935#(<= ~counter~0 6)} assume !(0 == ~cond); {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,195 INFO L290 TraceCheckUtils]: 67: Hoare triple {7935#(<= ~counter~0 6)} assume true; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,196 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7935#(<= ~counter~0 6)} {7935#(<= ~counter~0 6)} #63#return; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,196 INFO L290 TraceCheckUtils]: 69: Hoare triple {7935#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,196 INFO L290 TraceCheckUtils]: 70: Hoare triple {7935#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:47,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {7935#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,197 INFO L290 TraceCheckUtils]: 72: Hoare triple {7963#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,198 INFO L272 TraceCheckUtils]: 73: Hoare triple {7963#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {7963#(<= ~counter~0 7)} ~cond := #in~cond; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,198 INFO L290 TraceCheckUtils]: 75: Hoare triple {7963#(<= ~counter~0 7)} assume !(0 == ~cond); {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,198 INFO L290 TraceCheckUtils]: 76: Hoare triple {7963#(<= ~counter~0 7)} assume true; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,199 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7963#(<= ~counter~0 7)} {7963#(<= ~counter~0 7)} #63#return; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,199 INFO L290 TraceCheckUtils]: 78: Hoare triple {7963#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,199 INFO L290 TraceCheckUtils]: 79: Hoare triple {7963#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:47,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {7963#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,200 INFO L290 TraceCheckUtils]: 81: Hoare triple {7991#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,201 INFO L272 TraceCheckUtils]: 82: Hoare triple {7991#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {7991#(<= ~counter~0 8)} ~cond := #in~cond; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {7991#(<= ~counter~0 8)} assume !(0 == ~cond); {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,201 INFO L290 TraceCheckUtils]: 85: Hoare triple {7991#(<= ~counter~0 8)} assume true; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,202 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7991#(<= ~counter~0 8)} {7991#(<= ~counter~0 8)} #63#return; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {7991#(<= ~counter~0 8)} assume !!(0 != ~r~0); {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,202 INFO L290 TraceCheckUtils]: 88: Hoare triple {7991#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:47,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {7991#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {8019#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,203 INFO L272 TraceCheckUtils]: 91: Hoare triple {8019#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {8019#(<= ~counter~0 9)} ~cond := #in~cond; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,204 INFO L290 TraceCheckUtils]: 93: Hoare triple {8019#(<= ~counter~0 9)} assume !(0 == ~cond); {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {8019#(<= ~counter~0 9)} assume true; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,205 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8019#(<= ~counter~0 9)} {8019#(<= ~counter~0 9)} #63#return; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {8019#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,205 INFO L290 TraceCheckUtils]: 97: Hoare triple {8019#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:47,206 INFO L290 TraceCheckUtils]: 98: Hoare triple {8019#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,206 INFO L290 TraceCheckUtils]: 99: Hoare triple {8047#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,206 INFO L272 TraceCheckUtils]: 100: Hoare triple {8047#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 101: Hoare triple {8047#(<= ~counter~0 10)} ~cond := #in~cond; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {8047#(<= ~counter~0 10)} assume !(0 == ~cond); {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,207 INFO L290 TraceCheckUtils]: 103: Hoare triple {8047#(<= ~counter~0 10)} assume true; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,208 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {8047#(<= ~counter~0 10)} {8047#(<= ~counter~0 10)} #63#return; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,208 INFO L290 TraceCheckUtils]: 105: Hoare triple {8047#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,208 INFO L290 TraceCheckUtils]: 106: Hoare triple {8047#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:47,209 INFO L290 TraceCheckUtils]: 107: Hoare triple {8047#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,209 INFO L290 TraceCheckUtils]: 108: Hoare triple {8075#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,209 INFO L272 TraceCheckUtils]: 109: Hoare triple {8075#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,210 INFO L290 TraceCheckUtils]: 110: Hoare triple {8075#(<= ~counter~0 11)} ~cond := #in~cond; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,210 INFO L290 TraceCheckUtils]: 111: Hoare triple {8075#(<= ~counter~0 11)} assume !(0 == ~cond); {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,210 INFO L290 TraceCheckUtils]: 112: Hoare triple {8075#(<= ~counter~0 11)} assume true; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,211 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8075#(<= ~counter~0 11)} {8075#(<= ~counter~0 11)} #63#return; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,211 INFO L290 TraceCheckUtils]: 114: Hoare triple {8075#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,211 INFO L290 TraceCheckUtils]: 115: Hoare triple {8075#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:47,212 INFO L290 TraceCheckUtils]: 116: Hoare triple {8075#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,212 INFO L290 TraceCheckUtils]: 117: Hoare triple {8103#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,212 INFO L272 TraceCheckUtils]: 118: Hoare triple {8103#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,213 INFO L290 TraceCheckUtils]: 119: Hoare triple {8103#(<= ~counter~0 12)} ~cond := #in~cond; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,213 INFO L290 TraceCheckUtils]: 120: Hoare triple {8103#(<= ~counter~0 12)} assume !(0 == ~cond); {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,213 INFO L290 TraceCheckUtils]: 121: Hoare triple {8103#(<= ~counter~0 12)} assume true; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,214 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {8103#(<= ~counter~0 12)} {8103#(<= ~counter~0 12)} #63#return; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,214 INFO L290 TraceCheckUtils]: 123: Hoare triple {8103#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,214 INFO L290 TraceCheckUtils]: 124: Hoare triple {8103#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:47,215 INFO L290 TraceCheckUtils]: 125: Hoare triple {8103#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,215 INFO L290 TraceCheckUtils]: 126: Hoare triple {8131#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,215 INFO L272 TraceCheckUtils]: 127: Hoare triple {8131#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,216 INFO L290 TraceCheckUtils]: 128: Hoare triple {8131#(<= ~counter~0 13)} ~cond := #in~cond; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,216 INFO L290 TraceCheckUtils]: 129: Hoare triple {8131#(<= ~counter~0 13)} assume !(0 == ~cond); {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,216 INFO L290 TraceCheckUtils]: 130: Hoare triple {8131#(<= ~counter~0 13)} assume true; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,217 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {8131#(<= ~counter~0 13)} {8131#(<= ~counter~0 13)} #63#return; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,217 INFO L290 TraceCheckUtils]: 132: Hoare triple {8131#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,217 INFO L290 TraceCheckUtils]: 133: Hoare triple {8131#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:47,217 INFO L290 TraceCheckUtils]: 134: Hoare triple {8131#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,218 INFO L290 TraceCheckUtils]: 135: Hoare triple {8159#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,218 INFO L272 TraceCheckUtils]: 136: Hoare triple {8159#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,218 INFO L290 TraceCheckUtils]: 137: Hoare triple {8159#(<= ~counter~0 14)} ~cond := #in~cond; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,219 INFO L290 TraceCheckUtils]: 138: Hoare triple {8159#(<= ~counter~0 14)} assume !(0 == ~cond); {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,219 INFO L290 TraceCheckUtils]: 139: Hoare triple {8159#(<= ~counter~0 14)} assume true; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,219 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {8159#(<= ~counter~0 14)} {8159#(<= ~counter~0 14)} #63#return; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,220 INFO L290 TraceCheckUtils]: 141: Hoare triple {8159#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,220 INFO L290 TraceCheckUtils]: 142: Hoare triple {8159#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:47,220 INFO L290 TraceCheckUtils]: 143: Hoare triple {8159#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,221 INFO L290 TraceCheckUtils]: 144: Hoare triple {8187#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,221 INFO L272 TraceCheckUtils]: 145: Hoare triple {8187#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,221 INFO L290 TraceCheckUtils]: 146: Hoare triple {8187#(<= ~counter~0 15)} ~cond := #in~cond; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,222 INFO L290 TraceCheckUtils]: 147: Hoare triple {8187#(<= ~counter~0 15)} assume !(0 == ~cond); {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,222 INFO L290 TraceCheckUtils]: 148: Hoare triple {8187#(<= ~counter~0 15)} assume true; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,222 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {8187#(<= ~counter~0 15)} {8187#(<= ~counter~0 15)} #63#return; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,223 INFO L290 TraceCheckUtils]: 150: Hoare triple {8187#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,223 INFO L290 TraceCheckUtils]: 151: Hoare triple {8187#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:47,223 INFO L290 TraceCheckUtils]: 152: Hoare triple {8187#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,224 INFO L290 TraceCheckUtils]: 153: Hoare triple {8215#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,224 INFO L272 TraceCheckUtils]: 154: Hoare triple {8215#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,224 INFO L290 TraceCheckUtils]: 155: Hoare triple {8215#(<= ~counter~0 16)} ~cond := #in~cond; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,225 INFO L290 TraceCheckUtils]: 156: Hoare triple {8215#(<= ~counter~0 16)} assume !(0 == ~cond); {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,225 INFO L290 TraceCheckUtils]: 157: Hoare triple {8215#(<= ~counter~0 16)} assume true; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,225 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {8215#(<= ~counter~0 16)} {8215#(<= ~counter~0 16)} #63#return; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,226 INFO L290 TraceCheckUtils]: 159: Hoare triple {8215#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,226 INFO L290 TraceCheckUtils]: 160: Hoare triple {8215#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:47,226 INFO L290 TraceCheckUtils]: 161: Hoare triple {8215#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,227 INFO L290 TraceCheckUtils]: 162: Hoare triple {8243#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,227 INFO L272 TraceCheckUtils]: 163: Hoare triple {8243#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,227 INFO L290 TraceCheckUtils]: 164: Hoare triple {8243#(<= ~counter~0 17)} ~cond := #in~cond; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,228 INFO L290 TraceCheckUtils]: 165: Hoare triple {8243#(<= ~counter~0 17)} assume !(0 == ~cond); {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,228 INFO L290 TraceCheckUtils]: 166: Hoare triple {8243#(<= ~counter~0 17)} assume true; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,228 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {8243#(<= ~counter~0 17)} {8243#(<= ~counter~0 17)} #63#return; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,229 INFO L290 TraceCheckUtils]: 168: Hoare triple {8243#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,229 INFO L290 TraceCheckUtils]: 169: Hoare triple {8243#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:47,229 INFO L290 TraceCheckUtils]: 170: Hoare triple {8243#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,230 INFO L290 TraceCheckUtils]: 171: Hoare triple {8271#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,230 INFO L272 TraceCheckUtils]: 172: Hoare triple {8271#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,230 INFO L290 TraceCheckUtils]: 173: Hoare triple {8271#(<= ~counter~0 18)} ~cond := #in~cond; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,231 INFO L290 TraceCheckUtils]: 174: Hoare triple {8271#(<= ~counter~0 18)} assume !(0 == ~cond); {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,231 INFO L290 TraceCheckUtils]: 175: Hoare triple {8271#(<= ~counter~0 18)} assume true; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,231 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {8271#(<= ~counter~0 18)} {8271#(<= ~counter~0 18)} #63#return; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,232 INFO L290 TraceCheckUtils]: 177: Hoare triple {8271#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,236 INFO L290 TraceCheckUtils]: 178: Hoare triple {8271#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:47,236 INFO L290 TraceCheckUtils]: 179: Hoare triple {8271#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,237 INFO L290 TraceCheckUtils]: 180: Hoare triple {8299#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,237 INFO L272 TraceCheckUtils]: 181: Hoare triple {8299#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,237 INFO L290 TraceCheckUtils]: 182: Hoare triple {8299#(<= ~counter~0 19)} ~cond := #in~cond; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,238 INFO L290 TraceCheckUtils]: 183: Hoare triple {8299#(<= ~counter~0 19)} assume !(0 == ~cond); {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,238 INFO L290 TraceCheckUtils]: 184: Hoare triple {8299#(<= ~counter~0 19)} assume true; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,238 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {8299#(<= ~counter~0 19)} {8299#(<= ~counter~0 19)} #63#return; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,239 INFO L290 TraceCheckUtils]: 186: Hoare triple {8299#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,239 INFO L290 TraceCheckUtils]: 187: Hoare triple {8299#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:47,239 INFO L290 TraceCheckUtils]: 188: Hoare triple {8299#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,240 INFO L290 TraceCheckUtils]: 189: Hoare triple {8327#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,240 INFO L272 TraceCheckUtils]: 190: Hoare triple {8327#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,240 INFO L290 TraceCheckUtils]: 191: Hoare triple {8327#(<= ~counter~0 20)} ~cond := #in~cond; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,241 INFO L290 TraceCheckUtils]: 192: Hoare triple {8327#(<= ~counter~0 20)} assume !(0 == ~cond); {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,241 INFO L290 TraceCheckUtils]: 193: Hoare triple {8327#(<= ~counter~0 20)} assume true; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,241 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {8327#(<= ~counter~0 20)} {8327#(<= ~counter~0 20)} #63#return; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,242 INFO L290 TraceCheckUtils]: 195: Hoare triple {8327#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,242 INFO L290 TraceCheckUtils]: 196: Hoare triple {8327#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:47,242 INFO L290 TraceCheckUtils]: 197: Hoare triple {8327#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,242 INFO L290 TraceCheckUtils]: 198: Hoare triple {8355#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,243 INFO L272 TraceCheckUtils]: 199: Hoare triple {8355#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,243 INFO L290 TraceCheckUtils]: 200: Hoare triple {8355#(<= ~counter~0 21)} ~cond := #in~cond; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,243 INFO L290 TraceCheckUtils]: 201: Hoare triple {8355#(<= ~counter~0 21)} assume !(0 == ~cond); {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,244 INFO L290 TraceCheckUtils]: 202: Hoare triple {8355#(<= ~counter~0 21)} assume true; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,244 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {8355#(<= ~counter~0 21)} {8355#(<= ~counter~0 21)} #63#return; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,244 INFO L290 TraceCheckUtils]: 204: Hoare triple {8355#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,245 INFO L290 TraceCheckUtils]: 205: Hoare triple {8355#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:47,245 INFO L290 TraceCheckUtils]: 206: Hoare triple {8355#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,245 INFO L290 TraceCheckUtils]: 207: Hoare triple {8383#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,246 INFO L272 TraceCheckUtils]: 208: Hoare triple {8383#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,246 INFO L290 TraceCheckUtils]: 209: Hoare triple {8383#(<= ~counter~0 22)} ~cond := #in~cond; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,246 INFO L290 TraceCheckUtils]: 210: Hoare triple {8383#(<= ~counter~0 22)} assume !(0 == ~cond); {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,247 INFO L290 TraceCheckUtils]: 211: Hoare triple {8383#(<= ~counter~0 22)} assume true; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,247 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {8383#(<= ~counter~0 22)} {8383#(<= ~counter~0 22)} #63#return; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,247 INFO L290 TraceCheckUtils]: 213: Hoare triple {8383#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,248 INFO L290 TraceCheckUtils]: 214: Hoare triple {8383#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:47,248 INFO L290 TraceCheckUtils]: 215: Hoare triple {8383#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,248 INFO L290 TraceCheckUtils]: 216: Hoare triple {8411#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,249 INFO L272 TraceCheckUtils]: 217: Hoare triple {8411#(<= ~counter~0 23)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,249 INFO L290 TraceCheckUtils]: 218: Hoare triple {8411#(<= ~counter~0 23)} ~cond := #in~cond; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,249 INFO L290 TraceCheckUtils]: 219: Hoare triple {8411#(<= ~counter~0 23)} assume !(0 == ~cond); {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,250 INFO L290 TraceCheckUtils]: 220: Hoare triple {8411#(<= ~counter~0 23)} assume true; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,250 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {8411#(<= ~counter~0 23)} {8411#(<= ~counter~0 23)} #63#return; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,250 INFO L290 TraceCheckUtils]: 222: Hoare triple {8411#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,251 INFO L290 TraceCheckUtils]: 223: Hoare triple {8411#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:47,251 INFO L290 TraceCheckUtils]: 224: Hoare triple {8411#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,251 INFO L290 TraceCheckUtils]: 225: Hoare triple {8439#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,252 INFO L272 TraceCheckUtils]: 226: Hoare triple {8439#(<= ~counter~0 24)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,253 INFO L290 TraceCheckUtils]: 227: Hoare triple {8439#(<= ~counter~0 24)} ~cond := #in~cond; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,253 INFO L290 TraceCheckUtils]: 228: Hoare triple {8439#(<= ~counter~0 24)} assume !(0 == ~cond); {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,253 INFO L290 TraceCheckUtils]: 229: Hoare triple {8439#(<= ~counter~0 24)} assume true; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,254 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {8439#(<= ~counter~0 24)} {8439#(<= ~counter~0 24)} #63#return; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,254 INFO L290 TraceCheckUtils]: 231: Hoare triple {8439#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,254 INFO L290 TraceCheckUtils]: 232: Hoare triple {8439#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:47,255 INFO L290 TraceCheckUtils]: 233: Hoare triple {8439#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,255 INFO L290 TraceCheckUtils]: 234: Hoare triple {8467#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,255 INFO L272 TraceCheckUtils]: 235: Hoare triple {8467#(<= ~counter~0 25)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,256 INFO L290 TraceCheckUtils]: 236: Hoare triple {8467#(<= ~counter~0 25)} ~cond := #in~cond; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,256 INFO L290 TraceCheckUtils]: 237: Hoare triple {8467#(<= ~counter~0 25)} assume !(0 == ~cond); {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,256 INFO L290 TraceCheckUtils]: 238: Hoare triple {8467#(<= ~counter~0 25)} assume true; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,257 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {8467#(<= ~counter~0 25)} {8467#(<= ~counter~0 25)} #63#return; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,257 INFO L290 TraceCheckUtils]: 240: Hoare triple {8467#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,257 INFO L290 TraceCheckUtils]: 241: Hoare triple {8467#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:47,258 INFO L290 TraceCheckUtils]: 242: Hoare triple {8467#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,258 INFO L290 TraceCheckUtils]: 243: Hoare triple {8495#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,258 INFO L272 TraceCheckUtils]: 244: Hoare triple {8495#(<= ~counter~0 26)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,259 INFO L290 TraceCheckUtils]: 245: Hoare triple {8495#(<= ~counter~0 26)} ~cond := #in~cond; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,259 INFO L290 TraceCheckUtils]: 246: Hoare triple {8495#(<= ~counter~0 26)} assume !(0 == ~cond); {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,259 INFO L290 TraceCheckUtils]: 247: Hoare triple {8495#(<= ~counter~0 26)} assume true; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,260 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {8495#(<= ~counter~0 26)} {8495#(<= ~counter~0 26)} #63#return; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,260 INFO L290 TraceCheckUtils]: 249: Hoare triple {8495#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,260 INFO L290 TraceCheckUtils]: 250: Hoare triple {8495#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:47,260 INFO L290 TraceCheckUtils]: 251: Hoare triple {8495#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,261 INFO L290 TraceCheckUtils]: 252: Hoare triple {8523#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,261 INFO L272 TraceCheckUtils]: 253: Hoare triple {8523#(<= ~counter~0 27)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,261 INFO L290 TraceCheckUtils]: 254: Hoare triple {8523#(<= ~counter~0 27)} ~cond := #in~cond; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,262 INFO L290 TraceCheckUtils]: 255: Hoare triple {8523#(<= ~counter~0 27)} assume !(0 == ~cond); {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,262 INFO L290 TraceCheckUtils]: 256: Hoare triple {8523#(<= ~counter~0 27)} assume true; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,263 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {8523#(<= ~counter~0 27)} {8523#(<= ~counter~0 27)} #63#return; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,263 INFO L290 TraceCheckUtils]: 258: Hoare triple {8523#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,263 INFO L290 TraceCheckUtils]: 259: Hoare triple {8523#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:47,263 INFO L290 TraceCheckUtils]: 260: Hoare triple {8523#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,264 INFO L290 TraceCheckUtils]: 261: Hoare triple {8551#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,264 INFO L272 TraceCheckUtils]: 262: Hoare triple {8551#(<= ~counter~0 28)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,264 INFO L290 TraceCheckUtils]: 263: Hoare triple {8551#(<= ~counter~0 28)} ~cond := #in~cond; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,265 INFO L290 TraceCheckUtils]: 264: Hoare triple {8551#(<= ~counter~0 28)} assume !(0 == ~cond); {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,265 INFO L290 TraceCheckUtils]: 265: Hoare triple {8551#(<= ~counter~0 28)} assume true; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,265 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {8551#(<= ~counter~0 28)} {8551#(<= ~counter~0 28)} #63#return; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,266 INFO L290 TraceCheckUtils]: 267: Hoare triple {8551#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,266 INFO L290 TraceCheckUtils]: 268: Hoare triple {8551#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:47,266 INFO L290 TraceCheckUtils]: 269: Hoare triple {8551#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,267 INFO L290 TraceCheckUtils]: 270: Hoare triple {8579#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,267 INFO L272 TraceCheckUtils]: 271: Hoare triple {8579#(<= ~counter~0 29)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,267 INFO L290 TraceCheckUtils]: 272: Hoare triple {8579#(<= ~counter~0 29)} ~cond := #in~cond; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,268 INFO L290 TraceCheckUtils]: 273: Hoare triple {8579#(<= ~counter~0 29)} assume !(0 == ~cond); {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,268 INFO L290 TraceCheckUtils]: 274: Hoare triple {8579#(<= ~counter~0 29)} assume true; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,268 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {8579#(<= ~counter~0 29)} {8579#(<= ~counter~0 29)} #63#return; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,269 INFO L290 TraceCheckUtils]: 276: Hoare triple {8579#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,269 INFO L290 TraceCheckUtils]: 277: Hoare triple {8579#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:47,269 INFO L290 TraceCheckUtils]: 278: Hoare triple {8579#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,270 INFO L290 TraceCheckUtils]: 279: Hoare triple {8607#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,270 INFO L272 TraceCheckUtils]: 280: Hoare triple {8607#(<= ~counter~0 30)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,270 INFO L290 TraceCheckUtils]: 281: Hoare triple {8607#(<= ~counter~0 30)} ~cond := #in~cond; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,271 INFO L290 TraceCheckUtils]: 282: Hoare triple {8607#(<= ~counter~0 30)} assume !(0 == ~cond); {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,271 INFO L290 TraceCheckUtils]: 283: Hoare triple {8607#(<= ~counter~0 30)} assume true; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,271 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {8607#(<= ~counter~0 30)} {8607#(<= ~counter~0 30)} #63#return; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,272 INFO L290 TraceCheckUtils]: 285: Hoare triple {8607#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,272 INFO L290 TraceCheckUtils]: 286: Hoare triple {8607#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:47,272 INFO L290 TraceCheckUtils]: 287: Hoare triple {8607#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,273 INFO L290 TraceCheckUtils]: 288: Hoare triple {8635#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,273 INFO L272 TraceCheckUtils]: 289: Hoare triple {8635#(<= ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,273 INFO L290 TraceCheckUtils]: 290: Hoare triple {8635#(<= ~counter~0 31)} ~cond := #in~cond; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,274 INFO L290 TraceCheckUtils]: 291: Hoare triple {8635#(<= ~counter~0 31)} assume !(0 == ~cond); {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,274 INFO L290 TraceCheckUtils]: 292: Hoare triple {8635#(<= ~counter~0 31)} assume true; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,274 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {8635#(<= ~counter~0 31)} {8635#(<= ~counter~0 31)} #63#return; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,275 INFO L290 TraceCheckUtils]: 294: Hoare triple {8635#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,275 INFO L290 TraceCheckUtils]: 295: Hoare triple {8635#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:47,275 INFO L290 TraceCheckUtils]: 296: Hoare triple {8635#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,275 INFO L290 TraceCheckUtils]: 297: Hoare triple {8663#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,276 INFO L272 TraceCheckUtils]: 298: Hoare triple {8663#(<= ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,276 INFO L290 TraceCheckUtils]: 299: Hoare triple {8663#(<= ~counter~0 32)} ~cond := #in~cond; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,279 INFO L290 TraceCheckUtils]: 300: Hoare triple {8663#(<= ~counter~0 32)} assume !(0 == ~cond); {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,280 INFO L290 TraceCheckUtils]: 301: Hoare triple {8663#(<= ~counter~0 32)} assume true; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,280 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {8663#(<= ~counter~0 32)} {8663#(<= ~counter~0 32)} #63#return; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,280 INFO L290 TraceCheckUtils]: 303: Hoare triple {8663#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,281 INFO L290 TraceCheckUtils]: 304: Hoare triple {8663#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:47,281 INFO L290 TraceCheckUtils]: 305: Hoare triple {8663#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,281 INFO L290 TraceCheckUtils]: 306: Hoare triple {8691#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,282 INFO L272 TraceCheckUtils]: 307: Hoare triple {8691#(<= ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,282 INFO L290 TraceCheckUtils]: 308: Hoare triple {8691#(<= ~counter~0 33)} ~cond := #in~cond; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,282 INFO L290 TraceCheckUtils]: 309: Hoare triple {8691#(<= ~counter~0 33)} assume !(0 == ~cond); {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,283 INFO L290 TraceCheckUtils]: 310: Hoare triple {8691#(<= ~counter~0 33)} assume true; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,283 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {8691#(<= ~counter~0 33)} {8691#(<= ~counter~0 33)} #63#return; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,283 INFO L290 TraceCheckUtils]: 312: Hoare triple {8691#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,284 INFO L290 TraceCheckUtils]: 313: Hoare triple {8691#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:47,284 INFO L290 TraceCheckUtils]: 314: Hoare triple {8691#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,284 INFO L290 TraceCheckUtils]: 315: Hoare triple {8719#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,285 INFO L272 TraceCheckUtils]: 316: Hoare triple {8719#(<= ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,285 INFO L290 TraceCheckUtils]: 317: Hoare triple {8719#(<= ~counter~0 34)} ~cond := #in~cond; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,285 INFO L290 TraceCheckUtils]: 318: Hoare triple {8719#(<= ~counter~0 34)} assume !(0 == ~cond); {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,286 INFO L290 TraceCheckUtils]: 319: Hoare triple {8719#(<= ~counter~0 34)} assume true; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,286 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {8719#(<= ~counter~0 34)} {8719#(<= ~counter~0 34)} #63#return; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,286 INFO L290 TraceCheckUtils]: 321: Hoare triple {8719#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,287 INFO L290 TraceCheckUtils]: 322: Hoare triple {8719#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:47,287 INFO L290 TraceCheckUtils]: 323: Hoare triple {8719#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,287 INFO L290 TraceCheckUtils]: 324: Hoare triple {8747#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,288 INFO L272 TraceCheckUtils]: 325: Hoare triple {8747#(<= ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,288 INFO L290 TraceCheckUtils]: 326: Hoare triple {8747#(<= ~counter~0 35)} ~cond := #in~cond; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,288 INFO L290 TraceCheckUtils]: 327: Hoare triple {8747#(<= ~counter~0 35)} assume !(0 == ~cond); {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,289 INFO L290 TraceCheckUtils]: 328: Hoare triple {8747#(<= ~counter~0 35)} assume true; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,289 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {8747#(<= ~counter~0 35)} {8747#(<= ~counter~0 35)} #63#return; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,289 INFO L290 TraceCheckUtils]: 330: Hoare triple {8747#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,290 INFO L290 TraceCheckUtils]: 331: Hoare triple {8747#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:47,290 INFO L290 TraceCheckUtils]: 332: Hoare triple {8747#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,290 INFO L290 TraceCheckUtils]: 333: Hoare triple {8775#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,291 INFO L272 TraceCheckUtils]: 334: Hoare triple {8775#(<= ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,291 INFO L290 TraceCheckUtils]: 335: Hoare triple {8775#(<= ~counter~0 36)} ~cond := #in~cond; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,291 INFO L290 TraceCheckUtils]: 336: Hoare triple {8775#(<= ~counter~0 36)} assume !(0 == ~cond); {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,292 INFO L290 TraceCheckUtils]: 337: Hoare triple {8775#(<= ~counter~0 36)} assume true; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,294 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {8775#(<= ~counter~0 36)} {8775#(<= ~counter~0 36)} #63#return; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,294 INFO L290 TraceCheckUtils]: 339: Hoare triple {8775#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,294 INFO L290 TraceCheckUtils]: 340: Hoare triple {8775#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:47,295 INFO L290 TraceCheckUtils]: 341: Hoare triple {8775#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,295 INFO L290 TraceCheckUtils]: 342: Hoare triple {8803#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,295 INFO L272 TraceCheckUtils]: 343: Hoare triple {8803#(<= ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,296 INFO L290 TraceCheckUtils]: 344: Hoare triple {8803#(<= ~counter~0 37)} ~cond := #in~cond; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,296 INFO L290 TraceCheckUtils]: 345: Hoare triple {8803#(<= ~counter~0 37)} assume !(0 == ~cond); {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,296 INFO L290 TraceCheckUtils]: 346: Hoare triple {8803#(<= ~counter~0 37)} assume true; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,297 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {8803#(<= ~counter~0 37)} {8803#(<= ~counter~0 37)} #63#return; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,297 INFO L290 TraceCheckUtils]: 348: Hoare triple {8803#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,297 INFO L290 TraceCheckUtils]: 349: Hoare triple {8803#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:47,298 INFO L290 TraceCheckUtils]: 350: Hoare triple {8803#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,298 INFO L290 TraceCheckUtils]: 351: Hoare triple {8831#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,298 INFO L272 TraceCheckUtils]: 352: Hoare triple {8831#(<= ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,299 INFO L290 TraceCheckUtils]: 353: Hoare triple {8831#(<= ~counter~0 38)} ~cond := #in~cond; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,299 INFO L290 TraceCheckUtils]: 354: Hoare triple {8831#(<= ~counter~0 38)} assume !(0 == ~cond); {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,299 INFO L290 TraceCheckUtils]: 355: Hoare triple {8831#(<= ~counter~0 38)} assume true; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,300 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {8831#(<= ~counter~0 38)} {8831#(<= ~counter~0 38)} #63#return; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,300 INFO L290 TraceCheckUtils]: 357: Hoare triple {8831#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,300 INFO L290 TraceCheckUtils]: 358: Hoare triple {8831#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:47,301 INFO L290 TraceCheckUtils]: 359: Hoare triple {8831#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,301 INFO L290 TraceCheckUtils]: 360: Hoare triple {8859#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,301 INFO L272 TraceCheckUtils]: 361: Hoare triple {8859#(<= ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,302 INFO L290 TraceCheckUtils]: 362: Hoare triple {8859#(<= ~counter~0 39)} ~cond := #in~cond; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,302 INFO L290 TraceCheckUtils]: 363: Hoare triple {8859#(<= ~counter~0 39)} assume !(0 == ~cond); {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,302 INFO L290 TraceCheckUtils]: 364: Hoare triple {8859#(<= ~counter~0 39)} assume true; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,303 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {8859#(<= ~counter~0 39)} {8859#(<= ~counter~0 39)} #63#return; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,303 INFO L290 TraceCheckUtils]: 366: Hoare triple {8859#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,303 INFO L290 TraceCheckUtils]: 367: Hoare triple {8859#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:47,304 INFO L290 TraceCheckUtils]: 368: Hoare triple {8859#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,304 INFO L290 TraceCheckUtils]: 369: Hoare triple {8887#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,304 INFO L272 TraceCheckUtils]: 370: Hoare triple {8887#(<= ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,305 INFO L290 TraceCheckUtils]: 371: Hoare triple {8887#(<= ~counter~0 40)} ~cond := #in~cond; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,305 INFO L290 TraceCheckUtils]: 372: Hoare triple {8887#(<= ~counter~0 40)} assume !(0 == ~cond); {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,305 INFO L290 TraceCheckUtils]: 373: Hoare triple {8887#(<= ~counter~0 40)} assume true; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,306 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {8887#(<= ~counter~0 40)} {8887#(<= ~counter~0 40)} #63#return; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,306 INFO L290 TraceCheckUtils]: 375: Hoare triple {8887#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,306 INFO L290 TraceCheckUtils]: 376: Hoare triple {8887#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:47,306 INFO L290 TraceCheckUtils]: 377: Hoare triple {8887#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,307 INFO L290 TraceCheckUtils]: 378: Hoare triple {8915#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,307 INFO L272 TraceCheckUtils]: 379: Hoare triple {8915#(<= ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,308 INFO L290 TraceCheckUtils]: 380: Hoare triple {8915#(<= ~counter~0 41)} ~cond := #in~cond; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,308 INFO L290 TraceCheckUtils]: 381: Hoare triple {8915#(<= ~counter~0 41)} assume !(0 == ~cond); {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,308 INFO L290 TraceCheckUtils]: 382: Hoare triple {8915#(<= ~counter~0 41)} assume true; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,309 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {8915#(<= ~counter~0 41)} {8915#(<= ~counter~0 41)} #63#return; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,309 INFO L290 TraceCheckUtils]: 384: Hoare triple {8915#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,309 INFO L290 TraceCheckUtils]: 385: Hoare triple {8915#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:47,309 INFO L290 TraceCheckUtils]: 386: Hoare triple {8915#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,310 INFO L290 TraceCheckUtils]: 387: Hoare triple {8943#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,310 INFO L272 TraceCheckUtils]: 388: Hoare triple {8943#(<= ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,310 INFO L290 TraceCheckUtils]: 389: Hoare triple {8943#(<= ~counter~0 42)} ~cond := #in~cond; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,311 INFO L290 TraceCheckUtils]: 390: Hoare triple {8943#(<= ~counter~0 42)} assume !(0 == ~cond); {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,311 INFO L290 TraceCheckUtils]: 391: Hoare triple {8943#(<= ~counter~0 42)} assume true; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,312 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {8943#(<= ~counter~0 42)} {8943#(<= ~counter~0 42)} #63#return; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,312 INFO L290 TraceCheckUtils]: 393: Hoare triple {8943#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,312 INFO L290 TraceCheckUtils]: 394: Hoare triple {8943#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:47,327 INFO L290 TraceCheckUtils]: 395: Hoare triple {8943#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,328 INFO L290 TraceCheckUtils]: 396: Hoare triple {8971#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,329 INFO L272 TraceCheckUtils]: 397: Hoare triple {8971#(<= ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,329 INFO L290 TraceCheckUtils]: 398: Hoare triple {8971#(<= ~counter~0 43)} ~cond := #in~cond; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,329 INFO L290 TraceCheckUtils]: 399: Hoare triple {8971#(<= ~counter~0 43)} assume !(0 == ~cond); {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,330 INFO L290 TraceCheckUtils]: 400: Hoare triple {8971#(<= ~counter~0 43)} assume true; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,330 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {8971#(<= ~counter~0 43)} {8971#(<= ~counter~0 43)} #63#return; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,330 INFO L290 TraceCheckUtils]: 402: Hoare triple {8971#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,331 INFO L290 TraceCheckUtils]: 403: Hoare triple {8971#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:47,331 INFO L290 TraceCheckUtils]: 404: Hoare triple {8971#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,331 INFO L290 TraceCheckUtils]: 405: Hoare triple {8999#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,332 INFO L272 TraceCheckUtils]: 406: Hoare triple {8999#(<= ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,332 INFO L290 TraceCheckUtils]: 407: Hoare triple {8999#(<= ~counter~0 44)} ~cond := #in~cond; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,332 INFO L290 TraceCheckUtils]: 408: Hoare triple {8999#(<= ~counter~0 44)} assume !(0 == ~cond); {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,333 INFO L290 TraceCheckUtils]: 409: Hoare triple {8999#(<= ~counter~0 44)} assume true; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,333 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {8999#(<= ~counter~0 44)} {8999#(<= ~counter~0 44)} #63#return; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,333 INFO L290 TraceCheckUtils]: 411: Hoare triple {8999#(<= ~counter~0 44)} assume !!(0 != ~r~0); {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,334 INFO L290 TraceCheckUtils]: 412: Hoare triple {8999#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:47,334 INFO L290 TraceCheckUtils]: 413: Hoare triple {8999#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,334 INFO L290 TraceCheckUtils]: 414: Hoare triple {9027#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,335 INFO L272 TraceCheckUtils]: 415: Hoare triple {9027#(<= ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,335 INFO L290 TraceCheckUtils]: 416: Hoare triple {9027#(<= ~counter~0 45)} ~cond := #in~cond; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,335 INFO L290 TraceCheckUtils]: 417: Hoare triple {9027#(<= ~counter~0 45)} assume !(0 == ~cond); {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,336 INFO L290 TraceCheckUtils]: 418: Hoare triple {9027#(<= ~counter~0 45)} assume true; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,336 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {9027#(<= ~counter~0 45)} {9027#(<= ~counter~0 45)} #63#return; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,336 INFO L290 TraceCheckUtils]: 420: Hoare triple {9027#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,337 INFO L290 TraceCheckUtils]: 421: Hoare triple {9027#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:47,337 INFO L290 TraceCheckUtils]: 422: Hoare triple {9027#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,337 INFO L290 TraceCheckUtils]: 423: Hoare triple {9055#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,338 INFO L272 TraceCheckUtils]: 424: Hoare triple {9055#(<= ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,338 INFO L290 TraceCheckUtils]: 425: Hoare triple {9055#(<= ~counter~0 46)} ~cond := #in~cond; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,338 INFO L290 TraceCheckUtils]: 426: Hoare triple {9055#(<= ~counter~0 46)} assume !(0 == ~cond); {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,339 INFO L290 TraceCheckUtils]: 427: Hoare triple {9055#(<= ~counter~0 46)} assume true; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,339 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {9055#(<= ~counter~0 46)} {9055#(<= ~counter~0 46)} #63#return; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,339 INFO L290 TraceCheckUtils]: 429: Hoare triple {9055#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,340 INFO L290 TraceCheckUtils]: 430: Hoare triple {9055#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:47,340 INFO L290 TraceCheckUtils]: 431: Hoare triple {9055#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9083#(<= |main_#t~post6| 46)} is VALID [2022-04-27 13:18:47,340 INFO L290 TraceCheckUtils]: 432: Hoare triple {9083#(<= |main_#t~post6| 46)} assume !(#t~post6 < 50);havoc #t~post6; {7739#false} is VALID [2022-04-27 13:18:47,341 INFO L272 TraceCheckUtils]: 433: Hoare triple {7739#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7739#false} is VALID [2022-04-27 13:18:47,341 INFO L290 TraceCheckUtils]: 434: Hoare triple {7739#false} ~cond := #in~cond; {7739#false} is VALID [2022-04-27 13:18:47,341 INFO L290 TraceCheckUtils]: 435: Hoare triple {7739#false} assume 0 == ~cond; {7739#false} is VALID [2022-04-27 13:18:47,341 INFO L290 TraceCheckUtils]: 436: Hoare triple {7739#false} assume !false; {7739#false} is VALID [2022-04-27 13:18:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:18:47,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:18:49,402 INFO L290 TraceCheckUtils]: 436: Hoare triple {7739#false} assume !false; {7739#false} is VALID [2022-04-27 13:18:49,403 INFO L290 TraceCheckUtils]: 435: Hoare triple {7739#false} assume 0 == ~cond; {7739#false} is VALID [2022-04-27 13:18:49,403 INFO L290 TraceCheckUtils]: 434: Hoare triple {7739#false} ~cond := #in~cond; {7739#false} is VALID [2022-04-27 13:18:49,403 INFO L272 TraceCheckUtils]: 433: Hoare triple {7739#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7739#false} is VALID [2022-04-27 13:18:49,403 INFO L290 TraceCheckUtils]: 432: Hoare triple {9111#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {7739#false} is VALID [2022-04-27 13:18:49,403 INFO L290 TraceCheckUtils]: 431: Hoare triple {9115#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9111#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:18:49,404 INFO L290 TraceCheckUtils]: 430: Hoare triple {9115#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9115#(< ~counter~0 50)} is VALID [2022-04-27 13:18:49,404 INFO L290 TraceCheckUtils]: 429: Hoare triple {9115#(< ~counter~0 50)} assume !!(0 != ~r~0); {9115#(< ~counter~0 50)} is VALID [2022-04-27 13:18:49,416 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {7738#true} {9115#(< ~counter~0 50)} #63#return; {9115#(< ~counter~0 50)} is VALID [2022-04-27 13:18:49,416 INFO L290 TraceCheckUtils]: 427: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,416 INFO L290 TraceCheckUtils]: 426: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,416 INFO L290 TraceCheckUtils]: 425: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,416 INFO L272 TraceCheckUtils]: 424: Hoare triple {9115#(< ~counter~0 50)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,417 INFO L290 TraceCheckUtils]: 423: Hoare triple {9115#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {9115#(< ~counter~0 50)} is VALID [2022-04-27 13:18:49,417 INFO L290 TraceCheckUtils]: 422: Hoare triple {9143#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9115#(< ~counter~0 50)} is VALID [2022-04-27 13:18:49,417 INFO L290 TraceCheckUtils]: 421: Hoare triple {9143#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9143#(< ~counter~0 49)} is VALID [2022-04-27 13:18:49,418 INFO L290 TraceCheckUtils]: 420: Hoare triple {9143#(< ~counter~0 49)} assume !!(0 != ~r~0); {9143#(< ~counter~0 49)} is VALID [2022-04-27 13:18:49,418 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {7738#true} {9143#(< ~counter~0 49)} #63#return; {9143#(< ~counter~0 49)} is VALID [2022-04-27 13:18:49,418 INFO L290 TraceCheckUtils]: 418: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,418 INFO L290 TraceCheckUtils]: 417: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,418 INFO L290 TraceCheckUtils]: 416: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,418 INFO L272 TraceCheckUtils]: 415: Hoare triple {9143#(< ~counter~0 49)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,419 INFO L290 TraceCheckUtils]: 414: Hoare triple {9143#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {9143#(< ~counter~0 49)} is VALID [2022-04-27 13:18:49,419 INFO L290 TraceCheckUtils]: 413: Hoare triple {9171#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9143#(< ~counter~0 49)} is VALID [2022-04-27 13:18:49,419 INFO L290 TraceCheckUtils]: 412: Hoare triple {9171#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9171#(< ~counter~0 48)} is VALID [2022-04-27 13:18:49,420 INFO L290 TraceCheckUtils]: 411: Hoare triple {9171#(< ~counter~0 48)} assume !!(0 != ~r~0); {9171#(< ~counter~0 48)} is VALID [2022-04-27 13:18:49,420 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {7738#true} {9171#(< ~counter~0 48)} #63#return; {9171#(< ~counter~0 48)} is VALID [2022-04-27 13:18:49,420 INFO L290 TraceCheckUtils]: 409: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,420 INFO L290 TraceCheckUtils]: 408: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,420 INFO L290 TraceCheckUtils]: 407: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,420 INFO L272 TraceCheckUtils]: 406: Hoare triple {9171#(< ~counter~0 48)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,420 INFO L290 TraceCheckUtils]: 405: Hoare triple {9171#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9171#(< ~counter~0 48)} is VALID [2022-04-27 13:18:49,421 INFO L290 TraceCheckUtils]: 404: Hoare triple {9055#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9171#(< ~counter~0 48)} is VALID [2022-04-27 13:18:49,421 INFO L290 TraceCheckUtils]: 403: Hoare triple {9055#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:49,421 INFO L290 TraceCheckUtils]: 402: Hoare triple {9055#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:49,422 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {7738#true} {9055#(<= ~counter~0 46)} #63#return; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:49,422 INFO L290 TraceCheckUtils]: 400: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,422 INFO L290 TraceCheckUtils]: 399: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,422 INFO L290 TraceCheckUtils]: 398: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,422 INFO L272 TraceCheckUtils]: 397: Hoare triple {9055#(<= ~counter~0 46)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,422 INFO L290 TraceCheckUtils]: 396: Hoare triple {9055#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:49,423 INFO L290 TraceCheckUtils]: 395: Hoare triple {9027#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9055#(<= ~counter~0 46)} is VALID [2022-04-27 13:18:49,423 INFO L290 TraceCheckUtils]: 394: Hoare triple {9027#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:49,423 INFO L290 TraceCheckUtils]: 393: Hoare triple {9027#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:49,424 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {7738#true} {9027#(<= ~counter~0 45)} #63#return; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:49,424 INFO L290 TraceCheckUtils]: 391: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,424 INFO L290 TraceCheckUtils]: 390: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,424 INFO L290 TraceCheckUtils]: 389: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,424 INFO L272 TraceCheckUtils]: 388: Hoare triple {9027#(<= ~counter~0 45)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,424 INFO L290 TraceCheckUtils]: 387: Hoare triple {9027#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:49,425 INFO L290 TraceCheckUtils]: 386: Hoare triple {8999#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9027#(<= ~counter~0 45)} is VALID [2022-04-27 13:18:49,425 INFO L290 TraceCheckUtils]: 385: Hoare triple {8999#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:49,425 INFO L290 TraceCheckUtils]: 384: Hoare triple {8999#(<= ~counter~0 44)} assume !!(0 != ~r~0); {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:49,426 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {7738#true} {8999#(<= ~counter~0 44)} #63#return; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:49,426 INFO L290 TraceCheckUtils]: 382: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,426 INFO L290 TraceCheckUtils]: 381: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,426 INFO L290 TraceCheckUtils]: 380: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,426 INFO L272 TraceCheckUtils]: 379: Hoare triple {8999#(<= ~counter~0 44)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,426 INFO L290 TraceCheckUtils]: 378: Hoare triple {8999#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:49,426 INFO L290 TraceCheckUtils]: 377: Hoare triple {8971#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8999#(<= ~counter~0 44)} is VALID [2022-04-27 13:18:49,427 INFO L290 TraceCheckUtils]: 376: Hoare triple {8971#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:49,427 INFO L290 TraceCheckUtils]: 375: Hoare triple {8971#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:49,427 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {7738#true} {8971#(<= ~counter~0 43)} #63#return; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:49,427 INFO L290 TraceCheckUtils]: 373: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,428 INFO L290 TraceCheckUtils]: 372: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,428 INFO L290 TraceCheckUtils]: 371: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,428 INFO L272 TraceCheckUtils]: 370: Hoare triple {8971#(<= ~counter~0 43)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,428 INFO L290 TraceCheckUtils]: 369: Hoare triple {8971#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:49,428 INFO L290 TraceCheckUtils]: 368: Hoare triple {8943#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8971#(<= ~counter~0 43)} is VALID [2022-04-27 13:18:49,429 INFO L290 TraceCheckUtils]: 367: Hoare triple {8943#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:49,429 INFO L290 TraceCheckUtils]: 366: Hoare triple {8943#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:49,429 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {7738#true} {8943#(<= ~counter~0 42)} #63#return; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:49,429 INFO L290 TraceCheckUtils]: 364: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,429 INFO L290 TraceCheckUtils]: 363: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,429 INFO L290 TraceCheckUtils]: 362: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,429 INFO L272 TraceCheckUtils]: 361: Hoare triple {8943#(<= ~counter~0 42)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,430 INFO L290 TraceCheckUtils]: 360: Hoare triple {8943#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:49,430 INFO L290 TraceCheckUtils]: 359: Hoare triple {8915#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8943#(<= ~counter~0 42)} is VALID [2022-04-27 13:18:49,430 INFO L290 TraceCheckUtils]: 358: Hoare triple {8915#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:49,431 INFO L290 TraceCheckUtils]: 357: Hoare triple {8915#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:49,431 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {7738#true} {8915#(<= ~counter~0 41)} #63#return; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:49,431 INFO L290 TraceCheckUtils]: 355: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,431 INFO L290 TraceCheckUtils]: 354: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,431 INFO L290 TraceCheckUtils]: 353: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,431 INFO L272 TraceCheckUtils]: 352: Hoare triple {8915#(<= ~counter~0 41)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,431 INFO L290 TraceCheckUtils]: 351: Hoare triple {8915#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:49,432 INFO L290 TraceCheckUtils]: 350: Hoare triple {8887#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8915#(<= ~counter~0 41)} is VALID [2022-04-27 13:18:49,432 INFO L290 TraceCheckUtils]: 349: Hoare triple {8887#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:49,432 INFO L290 TraceCheckUtils]: 348: Hoare triple {8887#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:49,433 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {7738#true} {8887#(<= ~counter~0 40)} #63#return; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:49,433 INFO L290 TraceCheckUtils]: 346: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,433 INFO L290 TraceCheckUtils]: 345: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,433 INFO L290 TraceCheckUtils]: 344: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,433 INFO L272 TraceCheckUtils]: 343: Hoare triple {8887#(<= ~counter~0 40)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,433 INFO L290 TraceCheckUtils]: 342: Hoare triple {8887#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:49,434 INFO L290 TraceCheckUtils]: 341: Hoare triple {8859#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8887#(<= ~counter~0 40)} is VALID [2022-04-27 13:18:49,434 INFO L290 TraceCheckUtils]: 340: Hoare triple {8859#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:49,434 INFO L290 TraceCheckUtils]: 339: Hoare triple {8859#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:49,435 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {7738#true} {8859#(<= ~counter~0 39)} #63#return; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:49,435 INFO L290 TraceCheckUtils]: 337: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,435 INFO L290 TraceCheckUtils]: 336: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,435 INFO L290 TraceCheckUtils]: 335: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,435 INFO L272 TraceCheckUtils]: 334: Hoare triple {8859#(<= ~counter~0 39)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,435 INFO L290 TraceCheckUtils]: 333: Hoare triple {8859#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:49,436 INFO L290 TraceCheckUtils]: 332: Hoare triple {8831#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= ~counter~0 39)} is VALID [2022-04-27 13:18:49,436 INFO L290 TraceCheckUtils]: 331: Hoare triple {8831#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:49,436 INFO L290 TraceCheckUtils]: 330: Hoare triple {8831#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:49,437 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {7738#true} {8831#(<= ~counter~0 38)} #63#return; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:49,437 INFO L290 TraceCheckUtils]: 328: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,437 INFO L290 TraceCheckUtils]: 327: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,437 INFO L290 TraceCheckUtils]: 326: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,437 INFO L272 TraceCheckUtils]: 325: Hoare triple {8831#(<= ~counter~0 38)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,437 INFO L290 TraceCheckUtils]: 324: Hoare triple {8831#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:49,437 INFO L290 TraceCheckUtils]: 323: Hoare triple {8803#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8831#(<= ~counter~0 38)} is VALID [2022-04-27 13:18:49,438 INFO L290 TraceCheckUtils]: 322: Hoare triple {8803#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:49,438 INFO L290 TraceCheckUtils]: 321: Hoare triple {8803#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:49,438 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {7738#true} {8803#(<= ~counter~0 37)} #63#return; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:49,438 INFO L290 TraceCheckUtils]: 319: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,439 INFO L290 TraceCheckUtils]: 318: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,439 INFO L290 TraceCheckUtils]: 317: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,439 INFO L272 TraceCheckUtils]: 316: Hoare triple {8803#(<= ~counter~0 37)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,439 INFO L290 TraceCheckUtils]: 315: Hoare triple {8803#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:49,439 INFO L290 TraceCheckUtils]: 314: Hoare triple {8775#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8803#(<= ~counter~0 37)} is VALID [2022-04-27 13:18:49,440 INFO L290 TraceCheckUtils]: 313: Hoare triple {8775#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:49,440 INFO L290 TraceCheckUtils]: 312: Hoare triple {8775#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:49,440 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {7738#true} {8775#(<= ~counter~0 36)} #63#return; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:49,440 INFO L290 TraceCheckUtils]: 310: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,440 INFO L290 TraceCheckUtils]: 309: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,440 INFO L290 TraceCheckUtils]: 308: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,441 INFO L272 TraceCheckUtils]: 307: Hoare triple {8775#(<= ~counter~0 36)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,441 INFO L290 TraceCheckUtils]: 306: Hoare triple {8775#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:49,441 INFO L290 TraceCheckUtils]: 305: Hoare triple {8747#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8775#(<= ~counter~0 36)} is VALID [2022-04-27 13:18:49,441 INFO L290 TraceCheckUtils]: 304: Hoare triple {8747#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:49,442 INFO L290 TraceCheckUtils]: 303: Hoare triple {8747#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:49,442 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {7738#true} {8747#(<= ~counter~0 35)} #63#return; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:49,442 INFO L290 TraceCheckUtils]: 301: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,442 INFO L290 TraceCheckUtils]: 300: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,442 INFO L290 TraceCheckUtils]: 299: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,442 INFO L272 TraceCheckUtils]: 298: Hoare triple {8747#(<= ~counter~0 35)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,443 INFO L290 TraceCheckUtils]: 297: Hoare triple {8747#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:49,443 INFO L290 TraceCheckUtils]: 296: Hoare triple {8719#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8747#(<= ~counter~0 35)} is VALID [2022-04-27 13:18:49,443 INFO L290 TraceCheckUtils]: 295: Hoare triple {8719#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:49,443 INFO L290 TraceCheckUtils]: 294: Hoare triple {8719#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:49,444 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {7738#true} {8719#(<= ~counter~0 34)} #63#return; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:49,444 INFO L290 TraceCheckUtils]: 292: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,444 INFO L290 TraceCheckUtils]: 291: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,444 INFO L290 TraceCheckUtils]: 290: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,444 INFO L272 TraceCheckUtils]: 289: Hoare triple {8719#(<= ~counter~0 34)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,444 INFO L290 TraceCheckUtils]: 288: Hoare triple {8719#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:49,445 INFO L290 TraceCheckUtils]: 287: Hoare triple {8691#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8719#(<= ~counter~0 34)} is VALID [2022-04-27 13:18:49,445 INFO L290 TraceCheckUtils]: 286: Hoare triple {8691#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:49,445 INFO L290 TraceCheckUtils]: 285: Hoare triple {8691#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:49,446 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {7738#true} {8691#(<= ~counter~0 33)} #63#return; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:49,446 INFO L290 TraceCheckUtils]: 283: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,446 INFO L290 TraceCheckUtils]: 282: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,446 INFO L290 TraceCheckUtils]: 281: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,446 INFO L272 TraceCheckUtils]: 280: Hoare triple {8691#(<= ~counter~0 33)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,446 INFO L290 TraceCheckUtils]: 279: Hoare triple {8691#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:49,447 INFO L290 TraceCheckUtils]: 278: Hoare triple {8663#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8691#(<= ~counter~0 33)} is VALID [2022-04-27 13:18:49,447 INFO L290 TraceCheckUtils]: 277: Hoare triple {8663#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:49,447 INFO L290 TraceCheckUtils]: 276: Hoare triple {8663#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:49,448 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {7738#true} {8663#(<= ~counter~0 32)} #63#return; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:49,448 INFO L290 TraceCheckUtils]: 274: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,448 INFO L290 TraceCheckUtils]: 273: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,448 INFO L290 TraceCheckUtils]: 272: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,448 INFO L272 TraceCheckUtils]: 271: Hoare triple {8663#(<= ~counter~0 32)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,448 INFO L290 TraceCheckUtils]: 270: Hoare triple {8663#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:49,448 INFO L290 TraceCheckUtils]: 269: Hoare triple {8635#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8663#(<= ~counter~0 32)} is VALID [2022-04-27 13:18:49,449 INFO L290 TraceCheckUtils]: 268: Hoare triple {8635#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:49,449 INFO L290 TraceCheckUtils]: 267: Hoare triple {8635#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:49,449 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {7738#true} {8635#(<= ~counter~0 31)} #63#return; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:49,450 INFO L290 TraceCheckUtils]: 265: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,450 INFO L290 TraceCheckUtils]: 264: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,450 INFO L290 TraceCheckUtils]: 263: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,450 INFO L272 TraceCheckUtils]: 262: Hoare triple {8635#(<= ~counter~0 31)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,450 INFO L290 TraceCheckUtils]: 261: Hoare triple {8635#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:49,450 INFO L290 TraceCheckUtils]: 260: Hoare triple {8607#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8635#(<= ~counter~0 31)} is VALID [2022-04-27 13:18:49,451 INFO L290 TraceCheckUtils]: 259: Hoare triple {8607#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:49,451 INFO L290 TraceCheckUtils]: 258: Hoare triple {8607#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:49,451 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {7738#true} {8607#(<= ~counter~0 30)} #63#return; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:49,451 INFO L290 TraceCheckUtils]: 256: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,451 INFO L290 TraceCheckUtils]: 255: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,451 INFO L290 TraceCheckUtils]: 254: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,452 INFO L272 TraceCheckUtils]: 253: Hoare triple {8607#(<= ~counter~0 30)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,452 INFO L290 TraceCheckUtils]: 252: Hoare triple {8607#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:49,452 INFO L290 TraceCheckUtils]: 251: Hoare triple {8579#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8607#(<= ~counter~0 30)} is VALID [2022-04-27 13:18:49,452 INFO L290 TraceCheckUtils]: 250: Hoare triple {8579#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:49,453 INFO L290 TraceCheckUtils]: 249: Hoare triple {8579#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:49,453 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {7738#true} {8579#(<= ~counter~0 29)} #63#return; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:49,453 INFO L290 TraceCheckUtils]: 247: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,454 INFO L290 TraceCheckUtils]: 246: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,454 INFO L290 TraceCheckUtils]: 245: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,454 INFO L272 TraceCheckUtils]: 244: Hoare triple {8579#(<= ~counter~0 29)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,454 INFO L290 TraceCheckUtils]: 243: Hoare triple {8579#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:49,454 INFO L290 TraceCheckUtils]: 242: Hoare triple {8551#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8579#(<= ~counter~0 29)} is VALID [2022-04-27 13:18:49,455 INFO L290 TraceCheckUtils]: 241: Hoare triple {8551#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:49,455 INFO L290 TraceCheckUtils]: 240: Hoare triple {8551#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:49,455 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {7738#true} {8551#(<= ~counter~0 28)} #63#return; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:49,455 INFO L290 TraceCheckUtils]: 238: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,455 INFO L290 TraceCheckUtils]: 237: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,455 INFO L290 TraceCheckUtils]: 236: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,455 INFO L272 TraceCheckUtils]: 235: Hoare triple {8551#(<= ~counter~0 28)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,456 INFO L290 TraceCheckUtils]: 234: Hoare triple {8551#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:49,456 INFO L290 TraceCheckUtils]: 233: Hoare triple {8523#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8551#(<= ~counter~0 28)} is VALID [2022-04-27 13:18:49,456 INFO L290 TraceCheckUtils]: 232: Hoare triple {8523#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:49,457 INFO L290 TraceCheckUtils]: 231: Hoare triple {8523#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:49,457 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {7738#true} {8523#(<= ~counter~0 27)} #63#return; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:49,457 INFO L290 TraceCheckUtils]: 229: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,457 INFO L290 TraceCheckUtils]: 228: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,457 INFO L290 TraceCheckUtils]: 227: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,457 INFO L272 TraceCheckUtils]: 226: Hoare triple {8523#(<= ~counter~0 27)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,458 INFO L290 TraceCheckUtils]: 225: Hoare triple {8523#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:49,458 INFO L290 TraceCheckUtils]: 224: Hoare triple {8495#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8523#(<= ~counter~0 27)} is VALID [2022-04-27 13:18:49,458 INFO L290 TraceCheckUtils]: 223: Hoare triple {8495#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:49,458 INFO L290 TraceCheckUtils]: 222: Hoare triple {8495#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:49,459 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {7738#true} {8495#(<= ~counter~0 26)} #63#return; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:49,459 INFO L290 TraceCheckUtils]: 220: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,459 INFO L290 TraceCheckUtils]: 219: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,459 INFO L290 TraceCheckUtils]: 218: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,459 INFO L272 TraceCheckUtils]: 217: Hoare triple {8495#(<= ~counter~0 26)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,459 INFO L290 TraceCheckUtils]: 216: Hoare triple {8495#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:49,460 INFO L290 TraceCheckUtils]: 215: Hoare triple {8467#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8495#(<= ~counter~0 26)} is VALID [2022-04-27 13:18:49,460 INFO L290 TraceCheckUtils]: 214: Hoare triple {8467#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:49,460 INFO L290 TraceCheckUtils]: 213: Hoare triple {8467#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:49,461 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {7738#true} {8467#(<= ~counter~0 25)} #63#return; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:49,461 INFO L290 TraceCheckUtils]: 211: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,461 INFO L290 TraceCheckUtils]: 210: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,461 INFO L290 TraceCheckUtils]: 209: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,461 INFO L272 TraceCheckUtils]: 208: Hoare triple {8467#(<= ~counter~0 25)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,461 INFO L290 TraceCheckUtils]: 207: Hoare triple {8467#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:49,462 INFO L290 TraceCheckUtils]: 206: Hoare triple {8439#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8467#(<= ~counter~0 25)} is VALID [2022-04-27 13:18:49,462 INFO L290 TraceCheckUtils]: 205: Hoare triple {8439#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:49,462 INFO L290 TraceCheckUtils]: 204: Hoare triple {8439#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:49,463 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7738#true} {8439#(<= ~counter~0 24)} #63#return; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:49,463 INFO L290 TraceCheckUtils]: 202: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,463 INFO L290 TraceCheckUtils]: 201: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,463 INFO L290 TraceCheckUtils]: 200: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,463 INFO L272 TraceCheckUtils]: 199: Hoare triple {8439#(<= ~counter~0 24)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,463 INFO L290 TraceCheckUtils]: 198: Hoare triple {8439#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:49,464 INFO L290 TraceCheckUtils]: 197: Hoare triple {8411#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8439#(<= ~counter~0 24)} is VALID [2022-04-27 13:18:49,464 INFO L290 TraceCheckUtils]: 196: Hoare triple {8411#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:49,464 INFO L290 TraceCheckUtils]: 195: Hoare triple {8411#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:49,465 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {7738#true} {8411#(<= ~counter~0 23)} #63#return; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:49,465 INFO L290 TraceCheckUtils]: 193: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,465 INFO L290 TraceCheckUtils]: 192: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,465 INFO L290 TraceCheckUtils]: 191: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,465 INFO L272 TraceCheckUtils]: 190: Hoare triple {8411#(<= ~counter~0 23)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,465 INFO L290 TraceCheckUtils]: 189: Hoare triple {8411#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:49,465 INFO L290 TraceCheckUtils]: 188: Hoare triple {8383#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8411#(<= ~counter~0 23)} is VALID [2022-04-27 13:18:49,466 INFO L290 TraceCheckUtils]: 187: Hoare triple {8383#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:49,466 INFO L290 TraceCheckUtils]: 186: Hoare triple {8383#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:49,466 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {7738#true} {8383#(<= ~counter~0 22)} #63#return; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:49,466 INFO L290 TraceCheckUtils]: 184: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,467 INFO L290 TraceCheckUtils]: 183: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,467 INFO L290 TraceCheckUtils]: 182: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,467 INFO L272 TraceCheckUtils]: 181: Hoare triple {8383#(<= ~counter~0 22)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,467 INFO L290 TraceCheckUtils]: 180: Hoare triple {8383#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:49,467 INFO L290 TraceCheckUtils]: 179: Hoare triple {8355#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8383#(<= ~counter~0 22)} is VALID [2022-04-27 13:18:49,468 INFO L290 TraceCheckUtils]: 178: Hoare triple {8355#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:49,468 INFO L290 TraceCheckUtils]: 177: Hoare triple {8355#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:49,468 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {7738#true} {8355#(<= ~counter~0 21)} #63#return; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:49,468 INFO L290 TraceCheckUtils]: 175: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,468 INFO L290 TraceCheckUtils]: 174: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,468 INFO L290 TraceCheckUtils]: 173: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,468 INFO L272 TraceCheckUtils]: 172: Hoare triple {8355#(<= ~counter~0 21)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,469 INFO L290 TraceCheckUtils]: 171: Hoare triple {8355#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:49,469 INFO L290 TraceCheckUtils]: 170: Hoare triple {8327#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8355#(<= ~counter~0 21)} is VALID [2022-04-27 13:18:49,469 INFO L290 TraceCheckUtils]: 169: Hoare triple {8327#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:49,470 INFO L290 TraceCheckUtils]: 168: Hoare triple {8327#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:49,470 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {7738#true} {8327#(<= ~counter~0 20)} #63#return; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:49,470 INFO L290 TraceCheckUtils]: 166: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,470 INFO L290 TraceCheckUtils]: 165: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,470 INFO L290 TraceCheckUtils]: 164: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,470 INFO L272 TraceCheckUtils]: 163: Hoare triple {8327#(<= ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,471 INFO L290 TraceCheckUtils]: 162: Hoare triple {8327#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:49,471 INFO L290 TraceCheckUtils]: 161: Hoare triple {8299#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8327#(<= ~counter~0 20)} is VALID [2022-04-27 13:18:49,471 INFO L290 TraceCheckUtils]: 160: Hoare triple {8299#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:49,471 INFO L290 TraceCheckUtils]: 159: Hoare triple {8299#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:49,472 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {7738#true} {8299#(<= ~counter~0 19)} #63#return; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:49,472 INFO L290 TraceCheckUtils]: 157: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,472 INFO L290 TraceCheckUtils]: 156: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,472 INFO L290 TraceCheckUtils]: 155: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,472 INFO L272 TraceCheckUtils]: 154: Hoare triple {8299#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,472 INFO L290 TraceCheckUtils]: 153: Hoare triple {8299#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:49,473 INFO L290 TraceCheckUtils]: 152: Hoare triple {8271#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8299#(<= ~counter~0 19)} is VALID [2022-04-27 13:18:49,473 INFO L290 TraceCheckUtils]: 151: Hoare triple {8271#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:49,473 INFO L290 TraceCheckUtils]: 150: Hoare triple {8271#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:49,474 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {7738#true} {8271#(<= ~counter~0 18)} #63#return; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:49,474 INFO L290 TraceCheckUtils]: 148: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,474 INFO L290 TraceCheckUtils]: 147: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,474 INFO L290 TraceCheckUtils]: 146: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,474 INFO L272 TraceCheckUtils]: 145: Hoare triple {8271#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,489 INFO L290 TraceCheckUtils]: 144: Hoare triple {8271#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:49,490 INFO L290 TraceCheckUtils]: 143: Hoare triple {8243#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8271#(<= ~counter~0 18)} is VALID [2022-04-27 13:18:49,490 INFO L290 TraceCheckUtils]: 142: Hoare triple {8243#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:49,491 INFO L290 TraceCheckUtils]: 141: Hoare triple {8243#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:49,491 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {7738#true} {8243#(<= ~counter~0 17)} #63#return; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:49,491 INFO L290 TraceCheckUtils]: 139: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,491 INFO L290 TraceCheckUtils]: 138: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,491 INFO L290 TraceCheckUtils]: 137: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,492 INFO L272 TraceCheckUtils]: 136: Hoare triple {8243#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,492 INFO L290 TraceCheckUtils]: 135: Hoare triple {8243#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:49,492 INFO L290 TraceCheckUtils]: 134: Hoare triple {8215#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8243#(<= ~counter~0 17)} is VALID [2022-04-27 13:18:49,492 INFO L290 TraceCheckUtils]: 133: Hoare triple {8215#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:49,493 INFO L290 TraceCheckUtils]: 132: Hoare triple {8215#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:49,493 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7738#true} {8215#(<= ~counter~0 16)} #63#return; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:49,493 INFO L290 TraceCheckUtils]: 130: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,493 INFO L290 TraceCheckUtils]: 129: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,493 INFO L290 TraceCheckUtils]: 128: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,493 INFO L272 TraceCheckUtils]: 127: Hoare triple {8215#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {8215#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:49,494 INFO L290 TraceCheckUtils]: 125: Hoare triple {8187#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8215#(<= ~counter~0 16)} is VALID [2022-04-27 13:18:49,494 INFO L290 TraceCheckUtils]: 124: Hoare triple {8187#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:49,495 INFO L290 TraceCheckUtils]: 123: Hoare triple {8187#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:49,495 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {7738#true} {8187#(<= ~counter~0 15)} #63#return; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:49,495 INFO L290 TraceCheckUtils]: 121: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,495 INFO L290 TraceCheckUtils]: 120: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,495 INFO L290 TraceCheckUtils]: 119: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,495 INFO L272 TraceCheckUtils]: 118: Hoare triple {8187#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,496 INFO L290 TraceCheckUtils]: 117: Hoare triple {8187#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:49,496 INFO L290 TraceCheckUtils]: 116: Hoare triple {8159#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8187#(<= ~counter~0 15)} is VALID [2022-04-27 13:18:49,496 INFO L290 TraceCheckUtils]: 115: Hoare triple {8159#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:49,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {8159#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:49,503 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {7738#true} {8159#(<= ~counter~0 14)} #63#return; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:49,504 INFO L290 TraceCheckUtils]: 112: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,504 INFO L290 TraceCheckUtils]: 111: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,504 INFO L290 TraceCheckUtils]: 110: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,504 INFO L272 TraceCheckUtils]: 109: Hoare triple {8159#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,504 INFO L290 TraceCheckUtils]: 108: Hoare triple {8159#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:49,505 INFO L290 TraceCheckUtils]: 107: Hoare triple {8131#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8159#(<= ~counter~0 14)} is VALID [2022-04-27 13:18:49,505 INFO L290 TraceCheckUtils]: 106: Hoare triple {8131#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:49,505 INFO L290 TraceCheckUtils]: 105: Hoare triple {8131#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:49,506 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {7738#true} {8131#(<= ~counter~0 13)} #63#return; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:49,506 INFO L290 TraceCheckUtils]: 103: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,506 INFO L290 TraceCheckUtils]: 102: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,506 INFO L290 TraceCheckUtils]: 101: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,506 INFO L272 TraceCheckUtils]: 100: Hoare triple {8131#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,506 INFO L290 TraceCheckUtils]: 99: Hoare triple {8131#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:49,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {8103#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8131#(<= ~counter~0 13)} is VALID [2022-04-27 13:18:49,507 INFO L290 TraceCheckUtils]: 97: Hoare triple {8103#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:49,507 INFO L290 TraceCheckUtils]: 96: Hoare triple {8103#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:49,507 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7738#true} {8103#(<= ~counter~0 12)} #63#return; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:49,508 INFO L290 TraceCheckUtils]: 94: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,508 INFO L290 TraceCheckUtils]: 93: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,508 INFO L290 TraceCheckUtils]: 92: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,508 INFO L272 TraceCheckUtils]: 91: Hoare triple {8103#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,508 INFO L290 TraceCheckUtils]: 90: Hoare triple {8103#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:49,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {8075#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8103#(<= ~counter~0 12)} is VALID [2022-04-27 13:18:49,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {8075#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:49,509 INFO L290 TraceCheckUtils]: 87: Hoare triple {8075#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:49,509 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7738#true} {8075#(<= ~counter~0 11)} #63#return; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:49,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,510 INFO L290 TraceCheckUtils]: 83: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,510 INFO L272 TraceCheckUtils]: 82: Hoare triple {8075#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,510 INFO L290 TraceCheckUtils]: 81: Hoare triple {8075#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:49,510 INFO L290 TraceCheckUtils]: 80: Hoare triple {8047#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8075#(<= ~counter~0 11)} is VALID [2022-04-27 13:18:49,510 INFO L290 TraceCheckUtils]: 79: Hoare triple {8047#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:49,511 INFO L290 TraceCheckUtils]: 78: Hoare triple {8047#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:49,511 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7738#true} {8047#(<= ~counter~0 10)} #63#return; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:49,511 INFO L290 TraceCheckUtils]: 76: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,511 INFO L290 TraceCheckUtils]: 75: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,511 INFO L290 TraceCheckUtils]: 74: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,511 INFO L272 TraceCheckUtils]: 73: Hoare triple {8047#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,512 INFO L290 TraceCheckUtils]: 72: Hoare triple {8047#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:49,512 INFO L290 TraceCheckUtils]: 71: Hoare triple {8019#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8047#(<= ~counter~0 10)} is VALID [2022-04-27 13:18:49,512 INFO L290 TraceCheckUtils]: 70: Hoare triple {8019#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:49,513 INFO L290 TraceCheckUtils]: 69: Hoare triple {8019#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:49,513 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7738#true} {8019#(<= ~counter~0 9)} #63#return; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:49,513 INFO L290 TraceCheckUtils]: 67: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,513 INFO L290 TraceCheckUtils]: 66: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,513 INFO L290 TraceCheckUtils]: 65: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,513 INFO L272 TraceCheckUtils]: 64: Hoare triple {8019#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {8019#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:49,514 INFO L290 TraceCheckUtils]: 62: Hoare triple {7991#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8019#(<= ~counter~0 9)} is VALID [2022-04-27 13:18:49,514 INFO L290 TraceCheckUtils]: 61: Hoare triple {7991#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:49,514 INFO L290 TraceCheckUtils]: 60: Hoare triple {7991#(<= ~counter~0 8)} assume !!(0 != ~r~0); {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:49,515 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7738#true} {7991#(<= ~counter~0 8)} #63#return; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:49,515 INFO L290 TraceCheckUtils]: 58: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,515 INFO L290 TraceCheckUtils]: 57: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,515 INFO L290 TraceCheckUtils]: 56: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,515 INFO L272 TraceCheckUtils]: 55: Hoare triple {7991#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,515 INFO L290 TraceCheckUtils]: 54: Hoare triple {7991#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:49,516 INFO L290 TraceCheckUtils]: 53: Hoare triple {7963#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7991#(<= ~counter~0 8)} is VALID [2022-04-27 13:18:49,516 INFO L290 TraceCheckUtils]: 52: Hoare triple {7963#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:49,516 INFO L290 TraceCheckUtils]: 51: Hoare triple {7963#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:49,517 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7738#true} {7963#(<= ~counter~0 7)} #63#return; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:49,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,517 INFO L272 TraceCheckUtils]: 46: Hoare triple {7963#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,519 INFO L290 TraceCheckUtils]: 45: Hoare triple {7963#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:49,519 INFO L290 TraceCheckUtils]: 44: Hoare triple {7935#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7963#(<= ~counter~0 7)} is VALID [2022-04-27 13:18:49,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {7935#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:49,520 INFO L290 TraceCheckUtils]: 42: Hoare triple {7935#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:49,520 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7738#true} {7935#(<= ~counter~0 6)} #63#return; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:49,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,520 INFO L272 TraceCheckUtils]: 37: Hoare triple {7935#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {7935#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:49,521 INFO L290 TraceCheckUtils]: 35: Hoare triple {7907#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7935#(<= ~counter~0 6)} is VALID [2022-04-27 13:18:49,521 INFO L290 TraceCheckUtils]: 34: Hoare triple {7907#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:49,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {7907#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:49,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7738#true} {7907#(<= ~counter~0 5)} #63#return; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:49,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,522 INFO L272 TraceCheckUtils]: 28: Hoare triple {7907#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {7907#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:49,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {7879#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7907#(<= ~counter~0 5)} is VALID [2022-04-27 13:18:49,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {7879#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:49,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {7879#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:49,524 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7738#true} {7879#(<= ~counter~0 4)} #63#return; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:49,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,524 INFO L272 TraceCheckUtils]: 19: Hoare triple {7879#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {7879#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:49,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {7851#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7879#(<= ~counter~0 4)} is VALID [2022-04-27 13:18:49,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {7851#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,525 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7738#true} {7851#(<= ~counter~0 3)} #61#return; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,526 INFO L272 TraceCheckUtils]: 11: Hoare triple {7851#(<= ~counter~0 3)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7738#true} {7851#(<= ~counter~0 3)} #59#return; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {7738#true} assume true; {7738#true} is VALID [2022-04-27 13:18:49,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {7738#true} assume !(0 == ~cond); {7738#true} is VALID [2022-04-27 13:18:49,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {7738#true} ~cond := #in~cond; {7738#true} is VALID [2022-04-27 13:18:49,530 INFO L272 TraceCheckUtils]: 6: Hoare triple {7851#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7738#true} is VALID [2022-04-27 13:18:49,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {7851#(<= ~counter~0 3)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {7851#(<= ~counter~0 3)} call #t~ret7 := main(); {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7851#(<= ~counter~0 3)} {7738#true} #67#return; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {7851#(<= ~counter~0 3)} assume true; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {7738#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7851#(<= ~counter~0 3)} is VALID [2022-04-27 13:18:49,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {7738#true} call ULTIMATE.init(); {7738#true} is VALID [2022-04-27 13:18:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-04-27 13:18:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:18:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087421795] [2022-04-27 13:18:49,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:18:49,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866728098] [2022-04-27 13:18:49,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866728098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:18:49,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:18:49,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-27 13:18:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072090032] [2022-04-27 13:18:49,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:18:49,541 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.62962962962963) internal successors, (358), 54 states have internal predecessors, (358), 52 states have call successors, (100), 49 states have call predecessors, (100), 48 states have return successors, (98), 50 states have call predecessors, (98), 51 states have call successors, (98) Word has length 437