/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-e106359-m [2022-04-14 16:16:48,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:16:48,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:16:48,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:16:48,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:16:48,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:16:48,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:16:48,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:16:48,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:16:48,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:16:48,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:16:48,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:16:48,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:16:48,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:16:48,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:16:48,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:16:48,565 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:16:48,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:16:48,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:16:48,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:16:48,568 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:16:48,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:16:48,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:16:48,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:16:48,581 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:16:48,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:16:48,583 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:16:48,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:16:48,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:16:48,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:16:48,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:16:48,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:16:48,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:16:48,585 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:16:48,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:16:48,586 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:16:48,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:16:48,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:16:48,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:16:48,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:16:48,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:16:48,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:16:48,589 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-14 16:16:48,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:16:48,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:16:48,602 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:16:48,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:16:48,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:16:48,602 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:16:48,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:16:48,603 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:16:48,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:16:48,604 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:16:48,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:48,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:16:48,615 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:16:48,615 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:16:48,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:16:48,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:16:48,616 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:16:48,616 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:16:48,616 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:16:48,616 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-14 16:16:48,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:16:48,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:16:48,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:16:48,808 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:16:48,809 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:16:48,809 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-14 16:16:48,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f98bc32/a3946e2da7b1481ca55a2d69673453f6/FLAG1dd6168ea [2022-04-14 16:16:49,186 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:16:49,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-04-14 16:16:49,190 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f98bc32/a3946e2da7b1481ca55a2d69673453f6/FLAG1dd6168ea [2022-04-14 16:16:49,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f98bc32/a3946e2da7b1481ca55a2d69673453f6 [2022-04-14 16:16:49,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:16:49,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:16:49,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:49,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:16:49,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:16:49,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c26499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49, skipping insertion in model container [2022-04-14 16:16:49,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,642 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:16:49,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:16:49,791 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-14 16:16:49,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:49,821 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:16:49,835 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-14 16:16:49,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:16:49,864 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:16:49,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49 WrapperNode [2022-04-14 16:16:49,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:16:49,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:16:49,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:16:49,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:16:49,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:16:49,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:16:49,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:16:49,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:16:49,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (1/1) ... [2022-04-14 16:16:49,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:16:49,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:49,948 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-14 16:16:50,017 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-14 16:16:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:16:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:16:50,029 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:16:50,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:16:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:16:50,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:16:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:16:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:16:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:16:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:16:50,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:16:50,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:16:50,072 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:16:50,073 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:16:50,228 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:16:50,234 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:16:50,234 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 16:16:50,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:50 BoogieIcfgContainer [2022-04-14 16:16:50,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:16:50,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:16:50,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:16:50,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:16:50,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:16:49" (1/3) ... [2022-04-14 16:16:50,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82ba9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:50, skipping insertion in model container [2022-04-14 16:16:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:16:49" (2/3) ... [2022-04-14 16:16:50,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d82ba9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:16:50, skipping insertion in model container [2022-04-14 16:16:50,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:16:50" (3/3) ... [2022-04-14 16:16:50,251 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2022-04-14 16:16:50,254 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:16:50,254 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:16:50,298 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:16:50,314 INFO L340 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 [2022-04-14 16:16:50,314 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:16:50,327 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-14 16:16:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 16:16:50,330 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:50,330 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:50,331 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:50,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-14 16:16:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:50,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168162068] [2022-04-14 16:16:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:50,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:50,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:50,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160375022] [2022-04-14 16:16:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:50,463 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-14 16:16:50,509 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-14 16:16:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:50,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-14 16:16:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:50,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:50,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-14 16:16:50,662 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-14 16:16:50,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-14 16:16:50,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-14 16:16:50,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-14 16:16:50,663 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-14 16:16:50,663 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-14 16:16:50,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-14 16:16:50,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:50,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:50,664 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-14 16:16:50,665 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-14 16:16:50,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:50,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 16:16:50,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 16:16:50,665 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-14 16:16:50,665 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-14 16:16:50,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-14 16:16:50,666 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-14 16:16:50,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 16:16:50,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-14 16:16:50,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-14 16:16:50,667 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-14 16:16:50,667 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:50,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168162068] [2022-04-14 16:16:50,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:50,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160375022] [2022-04-14 16:16:50,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160375022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:50,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:50,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-14 16:16:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121017238] [2022-04-14 16:16:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:50,676 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-14 16:16:50,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:50,680 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-14 16:16:50,702 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-14 16:16:50,702 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-14 16:16:50,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:50,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-14 16:16:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-14 16:16:50,719 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-14 16:16:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:50,755 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-14 16:16:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-14 16:16:50,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-14 16:16:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:50,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-14 16:16:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:50,762 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-14 16:16:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-14 16:16:50,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-14 16:16:50,821 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-14 16:16:50,826 INFO L225 Difference]: With dead ends: 53 [2022-04-14 16:16:50,826 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 16:16:50,828 INFO L912 BasicCegarLoop]: 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-14 16:16:50,830 INFO L913 BasicCegarLoop]: 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-14 16:16:50,831 INFO L914 BasicCegarLoop]: 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-14 16:16:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 16:16:50,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 16:16:50,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:50,851 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-14 16:16:50,851 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-14 16:16:50,851 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-14 16:16:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:50,860 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:50,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:50,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:50,867 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-14 16:16:50,868 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-14 16:16:50,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:50,870 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-14 16:16:50,872 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:50,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:50,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:50,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:50,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:50,872 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-14 16:16:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-14 16:16:50,878 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-14 16:16:50,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:50,878 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-14 16:16:50,879 INFO L479 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-14 16:16:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-14 16:16:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:50,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:50,880 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:50,900 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-14 16:16:51,099 WARN L460 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-14 16:16:51,100 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:51,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:51,100 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-14 16:16:51,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:51,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342450380] [2022-04-14 16:16:51,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:51,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:51,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:51,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2055922210] [2022-04-14 16:16:51,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:51,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:51,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:51,137 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-14 16:16:51,193 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-14 16:16:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:51,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:16:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:51,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:51,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-14 16:16:51,369 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-14 16:16:51,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#(<= ~counter~0 0)} {256#true} #67#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#(<= ~counter~0 0)} call #t~ret7 := main(); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,372 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-14 16:16:51,373 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-14 16:16:51,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #59#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,376 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-14 16:16:51,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#(<= ~counter~0 0)} ~cond := #in~cond; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#(<= ~counter~0 0)} assume !(0 == ~cond); {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#(<= ~counter~0 0)} assume true; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,378 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#(<= ~counter~0 0)} {264#(<= ~counter~0 0)} #61#return; {264#(<= ~counter~0 0)} is VALID [2022-04-14 16:16:51,378 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-14 16:16:51,379 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-14 16:16:51,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {313#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {257#false} is VALID [2022-04-14 16:16:51,379 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-14 16:16:51,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-14 16:16:51,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-14 16:16:51,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-14 16:16:51,380 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-14 16:16:51,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342450380] [2022-04-14 16:16:51,380 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055922210] [2022-04-14 16:16:51,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055922210] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:51,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:51,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:16:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177019730] [2022-04-14 16:16:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:51,385 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-14 16:16:51,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:51,386 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-14 16:16:51,406 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-14 16:16:51,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:16:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:16:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:16:51,408 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-14 16:16:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:51,469 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 16:16:51,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:16:51,469 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-14 16:16:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:16:51,470 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-14 16:16:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:51,475 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-14 16:16:51,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-14 16:16:51,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-14 16:16:51,505 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-14 16:16:51,508 INFO L225 Difference]: With dead ends: 34 [2022-04-14 16:16:51,508 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 16:16:51,508 INFO L912 BasicCegarLoop]: 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-14 16:16:51,511 INFO L913 BasicCegarLoop]: 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-14 16:16:51,511 INFO L914 BasicCegarLoop]: 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-14 16:16:51,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 16:16:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 16:16:51,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:16:51,522 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-14 16:16:51,522 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-14 16:16:51,523 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-14 16:16:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:51,527 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:51,527 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:51,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:51,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:51,528 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-14 16:16:51,529 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-14 16:16:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:16:51,532 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:16:51,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:51,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:16:51,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:16:51,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:16:51,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:16:51,534 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-14 16:16:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-14 16:16:51,537 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-14 16:16:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:16:51,537 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-14 16:16:51,537 INFO L479 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-14 16:16:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:16:51,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:16:51,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:16:51,543 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:16:51,577 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-14 16:16:51,755 WARN L460 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-14 16:16:51,756 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:16:51,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:16:51,756 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-14 16:16:51,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:16:51,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811270471] [2022-04-14 16:16:51,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:51,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:16:51,771 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:16:51,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1305086887] [2022-04-14 16:16:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:16:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:16:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:16:51,773 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-14 16:16:51,787 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-14 16:16:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:51,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:16:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:16:51,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:16:52,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {469#true} is VALID [2022-04-14 16:16:52,592 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-14 16:16:52,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:52,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {469#true} {469#true} #67#return; {469#true} is VALID [2022-04-14 16:16:52,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {469#true} call #t~ret7 := main(); {469#true} is VALID [2022-04-14 16:16:52,593 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-14 16:16:52,593 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-14 16:16:52,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:52,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:52,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:52,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {469#true} {469#true} #59#return; {469#true} is VALID [2022-04-14 16:16:52,594 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-14 16:16:52,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {469#true} ~cond := #in~cond; {469#true} is VALID [2022-04-14 16:16:52,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#true} assume !(0 == ~cond); {469#true} is VALID [2022-04-14 16:16:52,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#true} assume true; {469#true} is VALID [2022-04-14 16:16:52,594 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {469#true} {469#true} #61#return; {469#true} is VALID [2022-04-14 16:16:54,529 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-14 16:16:54,547 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-14 16:16:54,548 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-14 16:16:56,556 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-14 16:16:56,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {536#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:16:56,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {536#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {470#false} is VALID [2022-04-14 16:16:56,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-14 16:16:56,558 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-14 16:16:56,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:16:56,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:16:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811270471] [2022-04-14 16:16:56,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:16:56,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305086887] [2022-04-14 16:16:56,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305086887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:16:56,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:16:56,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:16:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333607387] [2022-04-14 16:16:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:16:56,559 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-14 16:16:56,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:16:56,559 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-14 16:16:58,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 16:16:58,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:16:58,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:16:58,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:16:58,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:16:58,948 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-14 16:17:03,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:17:03,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:03,376 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-14 16:17:03,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:17:03,377 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-14 16:17:03,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:03,377 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-14 16:17:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-14 16:17:03,378 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-14 16:17:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-14 16:17:03,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-14 16:17:05,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:17:05,774 INFO L225 Difference]: With dead ends: 39 [2022-04-14 16:17:05,774 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 16:17:05,774 INFO L912 BasicCegarLoop]: 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-14 16:17:05,775 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:05,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-14 16:17:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 16:17:05,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-14 16:17:05,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:05,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:17:05,803 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:17:05,803 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:17:05,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:05,805 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-14 16:17:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-14 16:17:05,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:05,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:05,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-14 16:17:05,805 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-14 16:17:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:05,808 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-14 16:17:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-14 16:17:05,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:05,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:05,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:05,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 16:17:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-14 16:17:05,809 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-14 16:17:05,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:05,810 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-14 16:17:05,810 INFO L479 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-14 16:17:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-14 16:17:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:17:05,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:05,810 INFO L499 BasicCegarLoop]: 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-14 16:17:05,826 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-14 16:17:06,026 WARN L460 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-14 16:17:06,027 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-14 16:17:06,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:06,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679258187] [2022-04-14 16:17:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:06,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:06,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141637690] [2022-04-14 16:17:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:06,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:06,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:06,042 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-14 16:17:06,043 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-14 16:17:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:06,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 16:17:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:06,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:06,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-14 16:17:06,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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; {724#true} is VALID [2022-04-14 16:17:06,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-14 16:17:06,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-14 16:17:06,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-14 16:17:06,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-14 16:17:06,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-14 16:17:06,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-14 16:17:06,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 50);havoc #t~post6; {724#true} is VALID [2022-04-14 16:17:06,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-14 16:17:06,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:17:06,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:17:06,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:17:06,287 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {800#(= (+ (* 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-14 16:17:06,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#(= (+ (* 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); {804#(= (+ (* 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-14 16:17:06,288 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:17:06,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:17:06,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-14 16:17:06,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-14 16:17:06,289 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-14 16:17:06,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:06,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {725#false} assume !false; {725#false} is VALID [2022-04-14 16:17:06,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {812#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {725#false} is VALID [2022-04-14 16:17:06,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {808#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {812#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:17:06,616 INFO L272 TraceCheckUtils]: 25: Hoare triple {804#(= (+ (* 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)); {808#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:17:06,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {831#(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); {804#(= (+ (* 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-14 16:17:06,617 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} {724#true} #63#return; {831#(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-14 16:17:06,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:17:06,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:17:06,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {724#true} ~cond := #in~cond; {844#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:17:06,618 INFO L272 TraceCheckUtils]: 19: Hoare triple {724#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)); {724#true} is VALID [2022-04-14 16:17:06,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {724#true} assume !!(#t~post6 < 50);havoc #t~post6; {724#true} is VALID [2022-04-14 16:17:06,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {724#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {724#true} {724#true} #61#return; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L272 TraceCheckUtils]: 11: Hoare triple {724#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)); {724#true} is VALID [2022-04-14 16:17:06,619 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {724#true} {724#true} #59#return; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#true} assume !(0 == ~cond); {724#true} is VALID [2022-04-14 16:17:06,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {724#true} ~cond := #in~cond; {724#true} is VALID [2022-04-14 16:17:06,620 INFO L272 TraceCheckUtils]: 6: Hoare triple {724#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {724#true} is VALID [2022-04-14 16:17:06,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {724#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; {724#true} is VALID [2022-04-14 16:17:06,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {724#true} call #t~ret7 := main(); {724#true} is VALID [2022-04-14 16:17:06,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {724#true} {724#true} #67#return; {724#true} is VALID [2022-04-14 16:17:06,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {724#true} assume true; {724#true} is VALID [2022-04-14 16:17:06,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {724#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; {724#true} is VALID [2022-04-14 16:17:06,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {724#true} call ULTIMATE.init(); {724#true} is VALID [2022-04-14 16:17:06,620 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-14 16:17:06,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:06,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679258187] [2022-04-14 16:17:06,621 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:06,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141637690] [2022-04-14 16:17:06,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141637690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:06,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:06,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-14 16:17:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417555836] [2022-04-14 16:17:06,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:06,622 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-14 16:17:06,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:06,622 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-14 16:17:06,640 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-14 16:17:06,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:17:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:06,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:17:06,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:17:06,641 INFO L87 Difference]: Start difference. First operand 36 states and 43 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-14 16:17:06,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:06,994 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-14 16:17:06,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 16:17:06,994 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-14 16:17:06,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:06,996 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-14 16:17:06,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:17:06,997 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-14 16:17:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-14 16:17:06,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-14 16:17:07,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-14 16:17:07,032 INFO L225 Difference]: With dead ends: 43 [2022-04-14 16:17:07,032 INFO L226 Difference]: Without dead ends: 38 [2022-04-14 16:17:07,033 INFO L912 BasicCegarLoop]: 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-14 16:17:07,035 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:07,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 109 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:17:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-14 16:17:07,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-14 16:17:07,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:07,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 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-14 16:17:07,050 INFO L74 IsIncluded]: Start isIncluded. First operand 38 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-14 16:17:07,050 INFO L87 Difference]: Start difference. First operand 38 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-14 16:17:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:07,053 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-14 16:17:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-14 16:17:07,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:07,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:07,057 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 38 states. [2022-04-14 16:17:07,058 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 38 states. [2022-04-14 16:17:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:07,059 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-14 16:17:07,059 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-14 16:17:07,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:07,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:07,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:07,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:07,059 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-14 16:17:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-14 16:17:07,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-14 16:17:07,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:07,060 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-14 16:17:07,061 INFO L479 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-14 16:17:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-14 16:17:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 16:17:07,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:07,061 INFO L499 BasicCegarLoop]: 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-14 16:17:07,079 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-14 16:17:07,277 WARN L460 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-14 16:17:07,278 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:07,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:07,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-14 16:17:07,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:07,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423688435] [2022-04-14 16:17:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:07,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:07,287 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:07,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576518220] [2022-04-14 16:17:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:07,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:07,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:07,289 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-14 16:17:07,289 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-14 16:17:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:07,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:17:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:07,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:07,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-14 16:17:07,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#(<= ~counter~0 0)} {1091#true} #67#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#(<= ~counter~0 0)} call #t~ret7 := main(); {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#(<= ~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; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {1099#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #59#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {1099#(<= ~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)); {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {1099#(<= ~counter~0 0)} ~cond := #in~cond; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {1099#(<= ~counter~0 0)} assume !(0 == ~cond); {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1099#(<= ~counter~0 0)} assume true; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,503 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1099#(<= ~counter~0 0)} {1099#(<= ~counter~0 0)} #61#return; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {1099#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1099#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:07,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1099#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {1148#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {1148#(<= ~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)); {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1148#(<= ~counter~0 1)} ~cond := #in~cond; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(<= ~counter~0 1)} assume !(0 == ~cond); {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {1148#(<= ~counter~0 1)} assume true; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,506 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1148#(<= ~counter~0 1)} {1148#(<= ~counter~0 1)} #63#return; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,506 INFO L290 TraceCheckUtils]: 24: Hoare triple {1148#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1148#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1148#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:07,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {1148#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1176#(<= |main_#t~post6| 1)} is VALID [2022-04-14 16:17:07,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {1176#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {1092#false} is VALID [2022-04-14 16:17:07,507 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#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)); {1092#false} is VALID [2022-04-14 16:17:07,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-14 16:17:07,507 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-14 16:17:07,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-14 16:17:07,508 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-14 16:17:07,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:07,644 INFO L290 TraceCheckUtils]: 31: Hoare triple {1092#false} assume !false; {1092#false} is VALID [2022-04-14 16:17:07,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume 0 == ~cond; {1092#false} is VALID [2022-04-14 16:17:07,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} ~cond := #in~cond; {1092#false} is VALID [2022-04-14 16:17:07,645 INFO L272 TraceCheckUtils]: 28: Hoare triple {1092#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)); {1092#false} is VALID [2022-04-14 16:17:07,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {1204#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1092#false} is VALID [2022-04-14 16:17:07,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {1208#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1204#(< |main_#t~post6| 50)} is VALID [2022-04-14 16:17:07,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {1208#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1208#(< ~counter~0 50)} is VALID [2022-04-14 16:17:07,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {1208#(< ~counter~0 50)} assume !!(0 != ~r~0); {1208#(< ~counter~0 50)} is VALID [2022-04-14 16:17:07,647 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1091#true} {1208#(< ~counter~0 50)} #63#return; {1208#(< ~counter~0 50)} is VALID [2022-04-14 16:17:07,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-14 16:17:07,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-14 16:17:07,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-14 16:17:07,647 INFO L272 TraceCheckUtils]: 19: Hoare triple {1208#(< ~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)); {1091#true} is VALID [2022-04-14 16:17:07,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {1208#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1208#(< ~counter~0 50)} is VALID [2022-04-14 16:17:07,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {1236#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1208#(< ~counter~0 50)} is VALID [2022-04-14 16:17:07,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {1236#(< ~counter~0 49)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,649 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1091#true} {1236#(< ~counter~0 49)} #61#return; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-14 16:17:07,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-14 16:17:07,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-14 16:17:07,649 INFO L272 TraceCheckUtils]: 11: Hoare triple {1236#(< ~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)); {1091#true} is VALID [2022-04-14 16:17:07,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1091#true} {1236#(< ~counter~0 49)} #59#return; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {1091#true} assume true; {1091#true} is VALID [2022-04-14 16:17:07,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {1091#true} assume !(0 == ~cond); {1091#true} is VALID [2022-04-14 16:17:07,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {1091#true} ~cond := #in~cond; {1091#true} is VALID [2022-04-14 16:17:07,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {1236#(< ~counter~0 49)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1091#true} is VALID [2022-04-14 16:17:07,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {1236#(< ~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; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {1236#(< ~counter~0 49)} call #t~ret7 := main(); {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1236#(< ~counter~0 49)} {1091#true} #67#return; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1236#(< ~counter~0 49)} assume true; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#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; {1236#(< ~counter~0 49)} is VALID [2022-04-14 16:17:07,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {1091#true} call ULTIMATE.init(); {1091#true} is VALID [2022-04-14 16:17:07,654 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-14 16:17:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423688435] [2022-04-14 16:17:07,655 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576518220] [2022-04-14 16:17:07,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576518220] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:07,655 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:07,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 16:17:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728303534] [2022-04-14 16:17:07,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:07,655 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-14 16:17:07,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:07,656 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-14 16:17:07,689 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-14 16:17:07,689 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 16:17:07,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:07,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 16:17:07,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 16:17:07,690 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-14 16:17:07,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:07,820 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-14 16:17:07,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 16:17:07,821 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-14 16:17:07,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:07,821 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-14 16:17:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:17:07,823 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-14 16:17:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 67 transitions. [2022-04-14 16:17:07,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 67 transitions. [2022-04-14 16:17:07,865 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-14 16:17:07,866 INFO L225 Difference]: With dead ends: 61 [2022-04-14 16:17:07,866 INFO L226 Difference]: Without dead ends: 56 [2022-04-14 16:17:07,866 INFO L912 BasicCegarLoop]: 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-14 16:17:07,867 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:07,867 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:17:07,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-14 16:17:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-14 16:17:07,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:07,884 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-14 16:17:07,885 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-14 16:17:07,885 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-14 16:17:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:07,890 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:17:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:17:07,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:07,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:07,890 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-14 16:17:07,891 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-14 16:17:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:07,892 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-14 16:17:07,892 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:17:07,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:07,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:07,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:07,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:07,894 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-14 16:17:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-14 16:17:07,897 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-14 16:17:07,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:07,897 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-14 16:17:07,897 INFO L479 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-14 16:17:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-14 16:17:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-14 16:17:07,900 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:07,900 INFO L499 BasicCegarLoop]: 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-14 16:17:07,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 16:17:08,116 WARN L460 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-14 16:17:08,116 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:08,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:08,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 2 times [2022-04-14 16:17:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:08,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307734902] [2022-04-14 16:17:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:08,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:08,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1181963827] [2022-04-14 16:17:08,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:17:08,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:08,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:08,147 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-14 16:17:08,176 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-14 16:17:08,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:17:08,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:08,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:17:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:08,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:08,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-14 16:17:08,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#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; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1579#(<= ~counter~0 0)} {1571#true} #67#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {1579#(<= ~counter~0 0)} call #t~ret7 := main(); {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {1579#(<= ~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; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,505 INFO L272 TraceCheckUtils]: 6: Hoare triple {1579#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,510 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #59#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,510 INFO L272 TraceCheckUtils]: 11: Hoare triple {1579#(<= ~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)); {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {1579#(<= ~counter~0 0)} ~cond := #in~cond; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(<= ~counter~0 0)} assume !(0 == ~cond); {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {1579#(<= ~counter~0 0)} assume true; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,511 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1579#(<= ~counter~0 0)} {1579#(<= ~counter~0 0)} #61#return; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {1579#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1579#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:08,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {1579#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {1628#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,513 INFO L272 TraceCheckUtils]: 19: Hoare triple {1628#(<= ~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)); {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {1628#(<= ~counter~0 1)} ~cond := #in~cond; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {1628#(<= ~counter~0 1)} assume !(0 == ~cond); {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {1628#(<= ~counter~0 1)} assume true; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,515 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1628#(<= ~counter~0 1)} {1628#(<= ~counter~0 1)} #63#return; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {1628#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {1628#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1628#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:08,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {1628#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {1656#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,516 INFO L272 TraceCheckUtils]: 28: Hoare triple {1656#(<= ~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)); {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {1656#(<= ~counter~0 2)} ~cond := #in~cond; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {1656#(<= ~counter~0 2)} assume !(0 == ~cond); {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {1656#(<= ~counter~0 2)} assume true; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,518 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1656#(<= ~counter~0 2)} {1656#(<= ~counter~0 2)} #63#return; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {1656#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {1656#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1656#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:08,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {1656#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,519 INFO L290 TraceCheckUtils]: 36: Hoare triple {1684#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,520 INFO L272 TraceCheckUtils]: 37: Hoare triple {1684#(<= ~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)); {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {1684#(<= ~counter~0 3)} ~cond := #in~cond; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,520 INFO L290 TraceCheckUtils]: 39: Hoare triple {1684#(<= ~counter~0 3)} assume !(0 == ~cond); {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,520 INFO L290 TraceCheckUtils]: 40: Hoare triple {1684#(<= ~counter~0 3)} assume true; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,521 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1684#(<= ~counter~0 3)} {1684#(<= ~counter~0 3)} #63#return; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {1684#(<= ~counter~0 3)} assume !!(0 != ~r~0); {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,522 INFO L290 TraceCheckUtils]: 43: Hoare triple {1684#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1684#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:08,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {1684#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {1712#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,523 INFO L272 TraceCheckUtils]: 46: Hoare triple {1712#(<= ~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)); {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,523 INFO L290 TraceCheckUtils]: 47: Hoare triple {1712#(<= ~counter~0 4)} ~cond := #in~cond; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,523 INFO L290 TraceCheckUtils]: 48: Hoare triple {1712#(<= ~counter~0 4)} assume !(0 == ~cond); {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,524 INFO L290 TraceCheckUtils]: 49: Hoare triple {1712#(<= ~counter~0 4)} assume true; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,524 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1712#(<= ~counter~0 4)} {1712#(<= ~counter~0 4)} #63#return; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,524 INFO L290 TraceCheckUtils]: 51: Hoare triple {1712#(<= ~counter~0 4)} assume !!(0 != ~r~0); {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,525 INFO L290 TraceCheckUtils]: 52: Hoare triple {1712#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1712#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:08,525 INFO L290 TraceCheckUtils]: 53: Hoare triple {1712#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1740#(<= |main_#t~post6| 4)} is VALID [2022-04-14 16:17:08,525 INFO L290 TraceCheckUtils]: 54: Hoare triple {1740#(<= |main_#t~post6| 4)} assume !(#t~post6 < 50);havoc #t~post6; {1572#false} is VALID [2022-04-14 16:17:08,525 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#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)); {1572#false} is VALID [2022-04-14 16:17:08,525 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-14 16:17:08,525 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-14 16:17:08,526 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-14 16:17:08,526 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-14 16:17:08,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:08,825 INFO L290 TraceCheckUtils]: 58: Hoare triple {1572#false} assume !false; {1572#false} is VALID [2022-04-14 16:17:08,825 INFO L290 TraceCheckUtils]: 57: Hoare triple {1572#false} assume 0 == ~cond; {1572#false} is VALID [2022-04-14 16:17:08,825 INFO L290 TraceCheckUtils]: 56: Hoare triple {1572#false} ~cond := #in~cond; {1572#false} is VALID [2022-04-14 16:17:08,825 INFO L272 TraceCheckUtils]: 55: Hoare triple {1572#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)); {1572#false} is VALID [2022-04-14 16:17:08,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {1768#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1572#false} is VALID [2022-04-14 16:17:08,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {1772#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1768#(< |main_#t~post6| 50)} is VALID [2022-04-14 16:17:08,830 INFO L290 TraceCheckUtils]: 52: Hoare triple {1772#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1772#(< ~counter~0 50)} is VALID [2022-04-14 16:17:08,830 INFO L290 TraceCheckUtils]: 51: Hoare triple {1772#(< ~counter~0 50)} assume !!(0 != ~r~0); {1772#(< ~counter~0 50)} is VALID [2022-04-14 16:17:08,831 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1571#true} {1772#(< ~counter~0 50)} #63#return; {1772#(< ~counter~0 50)} is VALID [2022-04-14 16:17:08,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,832 INFO L290 TraceCheckUtils]: 48: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,832 INFO L290 TraceCheckUtils]: 47: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {1772#(< ~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)); {1571#true} is VALID [2022-04-14 16:17:08,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {1772#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {1772#(< ~counter~0 50)} is VALID [2022-04-14 16:17:08,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {1800#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1772#(< ~counter~0 50)} is VALID [2022-04-14 16:17:08,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {1800#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1800#(< ~counter~0 49)} is VALID [2022-04-14 16:17:08,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {1800#(< ~counter~0 49)} assume !!(0 != ~r~0); {1800#(< ~counter~0 49)} is VALID [2022-04-14 16:17:08,834 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1571#true} {1800#(< ~counter~0 49)} #63#return; {1800#(< ~counter~0 49)} is VALID [2022-04-14 16:17:08,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,834 INFO L290 TraceCheckUtils]: 39: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,834 INFO L272 TraceCheckUtils]: 37: Hoare triple {1800#(< ~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)); {1571#true} is VALID [2022-04-14 16:17:08,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {1800#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {1800#(< ~counter~0 49)} is VALID [2022-04-14 16:17:08,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {1828#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1800#(< ~counter~0 49)} is VALID [2022-04-14 16:17:08,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {1828#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1828#(< ~counter~0 48)} is VALID [2022-04-14 16:17:08,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {1828#(< ~counter~0 48)} assume !!(0 != ~r~0); {1828#(< ~counter~0 48)} is VALID [2022-04-14 16:17:08,837 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1571#true} {1828#(< ~counter~0 48)} #63#return; {1828#(< ~counter~0 48)} is VALID [2022-04-14 16:17:08,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,837 INFO L272 TraceCheckUtils]: 28: Hoare triple {1828#(< ~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)); {1571#true} is VALID [2022-04-14 16:17:08,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {1828#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {1828#(< ~counter~0 48)} is VALID [2022-04-14 16:17:08,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {1856#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1828#(< ~counter~0 48)} is VALID [2022-04-14 16:17:08,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {1856#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1856#(< ~counter~0 47)} is VALID [2022-04-14 16:17:08,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {1856#(< ~counter~0 47)} assume !!(0 != ~r~0); {1856#(< ~counter~0 47)} is VALID [2022-04-14 16:17:08,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1571#true} {1856#(< ~counter~0 47)} #63#return; {1856#(< ~counter~0 47)} is VALID [2022-04-14 16:17:08,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {1856#(< ~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)); {1571#true} is VALID [2022-04-14 16:17:08,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {1856#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {1856#(< ~counter~0 47)} is VALID [2022-04-14 16:17:08,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1884#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1856#(< ~counter~0 47)} is VALID [2022-04-14 16:17:08,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {1884#(< ~counter~0 46)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1571#true} {1884#(< ~counter~0 46)} #61#return; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {1884#(< ~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)); {1571#true} is VALID [2022-04-14 16:17:08,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1571#true} {1884#(< ~counter~0 46)} #59#return; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1571#true} assume true; {1571#true} is VALID [2022-04-14 16:17:08,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {1571#true} assume !(0 == ~cond); {1571#true} is VALID [2022-04-14 16:17:08,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {1571#true} ~cond := #in~cond; {1571#true} is VALID [2022-04-14 16:17:08,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {1884#(< ~counter~0 46)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1571#true} is VALID [2022-04-14 16:17:08,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {1884#(< ~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; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {1884#(< ~counter~0 46)} call #t~ret7 := main(); {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1884#(< ~counter~0 46)} {1571#true} #67#return; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1884#(< ~counter~0 46)} assume true; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1571#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; {1884#(< ~counter~0 46)} is VALID [2022-04-14 16:17:08,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {1571#true} call ULTIMATE.init(); {1571#true} is VALID [2022-04-14 16:17:08,844 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-14 16:17:08,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:08,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307734902] [2022-04-14 16:17:08,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:08,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181963827] [2022-04-14 16:17:08,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181963827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:08,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:08,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 16:17:08,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360473301] [2022-04-14 16:17:08,844 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:08,845 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-14 16:17:08,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:08,846 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-14 16:17:08,908 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-14 16:17:08,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 16:17:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 16:17:08,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:17:08,909 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-14 16:17:09,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:09,251 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-14 16:17:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-14 16:17:09,251 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-14 16:17:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:09,252 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-14 16:17:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-14 16:17:09,255 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-14 16:17:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 130 transitions. [2022-04-14 16:17:09,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 130 transitions. [2022-04-14 16:17:09,349 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-14 16:17:09,351 INFO L225 Difference]: With dead ends: 115 [2022-04-14 16:17:09,351 INFO L226 Difference]: Without dead ends: 110 [2022-04-14 16:17:09,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-14 16:17:09,352 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 80 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:09,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 160 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:17:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-14 16:17:09,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-14 16:17:09,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:09,384 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-14 16:17:09,384 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-14 16:17:09,384 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-14 16:17:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:09,387 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-14 16:17:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:17:09,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:09,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:09,387 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-14 16:17:09,388 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-14 16:17:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:09,390 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-14 16:17:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:17:09,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:09,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:09,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:09,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:09,391 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-14 16:17:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-14 16:17:09,393 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-14 16:17:09,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:09,393 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-14 16:17:09,394 INFO L479 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-14 16:17:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-14 16:17:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-14 16:17:09,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:09,395 INFO L499 BasicCegarLoop]: 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-14 16:17:09,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 16:17:09,607 WARN L460 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-14 16:17:09,608 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:09,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:09,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 3 times [2022-04-14 16:17:09,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:09,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585102930] [2022-04-14 16:17:09,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:09,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:09,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:09,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115984989] [2022-04-14 16:17:09,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:17:09,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:09,642 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-14 16:17:09,643 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-14 16:17:11,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-14 16:17:11,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:11,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 16:17:11,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:11,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:12,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-14 16:17:12,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2491#(<= ~counter~0 0)} {2483#true} #67#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {2491#(<= ~counter~0 0)} call #t~ret7 := main(); {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {2491#(<= ~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; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {2491#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {2491#(<= ~counter~0 0)} ~cond := #in~cond; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {2491#(<= ~counter~0 0)} assume !(0 == ~cond); {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,342 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} #59#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {2491#(<= ~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)); {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {2491#(<= ~counter~0 0)} ~cond := #in~cond; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {2491#(<= ~counter~0 0)} assume !(0 == ~cond); {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {2491#(<= ~counter~0 0)} assume true; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,343 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2491#(<= ~counter~0 0)} {2491#(<= ~counter~0 0)} #61#return; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {2491#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2491#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:12,345 INFO L290 TraceCheckUtils]: 17: Hoare triple {2491#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {2540#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,345 INFO L272 TraceCheckUtils]: 19: Hoare triple {2540#(<= ~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)); {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,346 INFO L290 TraceCheckUtils]: 20: Hoare triple {2540#(<= ~counter~0 1)} ~cond := #in~cond; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,346 INFO L290 TraceCheckUtils]: 21: Hoare triple {2540#(<= ~counter~0 1)} assume !(0 == ~cond); {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {2540#(<= ~counter~0 1)} assume true; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,347 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2540#(<= ~counter~0 1)} {2540#(<= ~counter~0 1)} #63#return; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {2540#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {2540#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2540#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:12,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {2540#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,348 INFO L290 TraceCheckUtils]: 27: Hoare triple {2568#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,349 INFO L272 TraceCheckUtils]: 28: Hoare triple {2568#(<= ~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)); {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {2568#(<= ~counter~0 2)} ~cond := #in~cond; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {2568#(<= ~counter~0 2)} assume !(0 == ~cond); {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {2568#(<= ~counter~0 2)} assume true; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,350 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2568#(<= ~counter~0 2)} {2568#(<= ~counter~0 2)} #63#return; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {2568#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {2568#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2568#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:12,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {2568#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {2596#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,352 INFO L272 TraceCheckUtils]: 37: Hoare triple {2596#(<= ~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)); {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {2596#(<= ~counter~0 3)} ~cond := #in~cond; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {2596#(<= ~counter~0 3)} assume !(0 == ~cond); {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {2596#(<= ~counter~0 3)} assume true; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,353 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2596#(<= ~counter~0 3)} {2596#(<= ~counter~0 3)} #63#return; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {2596#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,354 INFO L290 TraceCheckUtils]: 43: Hoare triple {2596#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2596#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:12,354 INFO L290 TraceCheckUtils]: 44: Hoare triple {2596#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,354 INFO L290 TraceCheckUtils]: 45: Hoare triple {2624#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,355 INFO L272 TraceCheckUtils]: 46: Hoare triple {2624#(<= ~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)); {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,355 INFO L290 TraceCheckUtils]: 47: Hoare triple {2624#(<= ~counter~0 4)} ~cond := #in~cond; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,356 INFO L290 TraceCheckUtils]: 48: Hoare triple {2624#(<= ~counter~0 4)} assume !(0 == ~cond); {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,356 INFO L290 TraceCheckUtils]: 49: Hoare triple {2624#(<= ~counter~0 4)} assume true; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,356 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2624#(<= ~counter~0 4)} {2624#(<= ~counter~0 4)} #63#return; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,357 INFO L290 TraceCheckUtils]: 51: Hoare triple {2624#(<= ~counter~0 4)} assume !!(0 != ~r~0); {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {2624#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2624#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:12,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {2624#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,358 INFO L290 TraceCheckUtils]: 54: Hoare triple {2652#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,358 INFO L272 TraceCheckUtils]: 55: Hoare triple {2652#(<= ~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)); {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,359 INFO L290 TraceCheckUtils]: 56: Hoare triple {2652#(<= ~counter~0 5)} ~cond := #in~cond; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,359 INFO L290 TraceCheckUtils]: 57: Hoare triple {2652#(<= ~counter~0 5)} assume !(0 == ~cond); {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,359 INFO L290 TraceCheckUtils]: 58: Hoare triple {2652#(<= ~counter~0 5)} assume true; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,360 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2652#(<= ~counter~0 5)} {2652#(<= ~counter~0 5)} #63#return; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {2652#(<= ~counter~0 5)} assume !!(0 != ~r~0); {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {2652#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2652#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:12,361 INFO L290 TraceCheckUtils]: 62: Hoare triple {2652#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,361 INFO L290 TraceCheckUtils]: 63: Hoare triple {2680#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,362 INFO L272 TraceCheckUtils]: 64: Hoare triple {2680#(<= ~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)); {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {2680#(<= ~counter~0 6)} ~cond := #in~cond; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,362 INFO L290 TraceCheckUtils]: 66: Hoare triple {2680#(<= ~counter~0 6)} assume !(0 == ~cond); {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,362 INFO L290 TraceCheckUtils]: 67: Hoare triple {2680#(<= ~counter~0 6)} assume true; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,363 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2680#(<= ~counter~0 6)} {2680#(<= ~counter~0 6)} #63#return; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,365 INFO L290 TraceCheckUtils]: 69: Hoare triple {2680#(<= ~counter~0 6)} assume !!(0 != ~r~0); {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,366 INFO L290 TraceCheckUtils]: 70: Hoare triple {2680#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2680#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:12,367 INFO L290 TraceCheckUtils]: 71: Hoare triple {2680#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,373 INFO L290 TraceCheckUtils]: 72: Hoare triple {2708#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,377 INFO L272 TraceCheckUtils]: 73: Hoare triple {2708#(<= ~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)); {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,377 INFO L290 TraceCheckUtils]: 74: Hoare triple {2708#(<= ~counter~0 7)} ~cond := #in~cond; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,377 INFO L290 TraceCheckUtils]: 75: Hoare triple {2708#(<= ~counter~0 7)} assume !(0 == ~cond); {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,377 INFO L290 TraceCheckUtils]: 76: Hoare triple {2708#(<= ~counter~0 7)} assume true; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,379 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2708#(<= ~counter~0 7)} {2708#(<= ~counter~0 7)} #63#return; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,379 INFO L290 TraceCheckUtils]: 78: Hoare triple {2708#(<= ~counter~0 7)} assume !!(0 != ~r~0); {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,380 INFO L290 TraceCheckUtils]: 79: Hoare triple {2708#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2708#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:12,380 INFO L290 TraceCheckUtils]: 80: Hoare triple {2708#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,380 INFO L290 TraceCheckUtils]: 81: Hoare triple {2736#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,381 INFO L272 TraceCheckUtils]: 82: Hoare triple {2736#(<= ~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)); {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,381 INFO L290 TraceCheckUtils]: 83: Hoare triple {2736#(<= ~counter~0 8)} ~cond := #in~cond; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,381 INFO L290 TraceCheckUtils]: 84: Hoare triple {2736#(<= ~counter~0 8)} assume !(0 == ~cond); {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,383 INFO L290 TraceCheckUtils]: 85: Hoare triple {2736#(<= ~counter~0 8)} assume true; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,384 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2736#(<= ~counter~0 8)} {2736#(<= ~counter~0 8)} #63#return; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,384 INFO L290 TraceCheckUtils]: 87: Hoare triple {2736#(<= ~counter~0 8)} assume !!(0 != ~r~0); {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {2736#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2736#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:12,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {2736#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {2764#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,386 INFO L272 TraceCheckUtils]: 91: Hoare triple {2764#(<= ~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)); {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {2764#(<= ~counter~0 9)} ~cond := #in~cond; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {2764#(<= ~counter~0 9)} assume !(0 == ~cond); {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,387 INFO L290 TraceCheckUtils]: 94: Hoare triple {2764#(<= ~counter~0 9)} assume true; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,387 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2764#(<= ~counter~0 9)} {2764#(<= ~counter~0 9)} #63#return; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,388 INFO L290 TraceCheckUtils]: 96: Hoare triple {2764#(<= ~counter~0 9)} assume !!(0 != ~r~0); {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,388 INFO L290 TraceCheckUtils]: 97: Hoare triple {2764#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2764#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:12,388 INFO L290 TraceCheckUtils]: 98: Hoare triple {2764#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,388 INFO L290 TraceCheckUtils]: 99: Hoare triple {2792#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,389 INFO L272 TraceCheckUtils]: 100: Hoare triple {2792#(<= ~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)); {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,389 INFO L290 TraceCheckUtils]: 101: Hoare triple {2792#(<= ~counter~0 10)} ~cond := #in~cond; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,390 INFO L290 TraceCheckUtils]: 102: Hoare triple {2792#(<= ~counter~0 10)} assume !(0 == ~cond); {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,390 INFO L290 TraceCheckUtils]: 103: Hoare triple {2792#(<= ~counter~0 10)} assume true; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,390 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2792#(<= ~counter~0 10)} {2792#(<= ~counter~0 10)} #63#return; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,391 INFO L290 TraceCheckUtils]: 105: Hoare triple {2792#(<= ~counter~0 10)} assume !!(0 != ~r~0); {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,391 INFO L290 TraceCheckUtils]: 106: Hoare triple {2792#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2792#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:12,391 INFO L290 TraceCheckUtils]: 107: Hoare triple {2792#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2820#(<= |main_#t~post6| 10)} is VALID [2022-04-14 16:17:12,392 INFO L290 TraceCheckUtils]: 108: Hoare triple {2820#(<= |main_#t~post6| 10)} assume !(#t~post6 < 50);havoc #t~post6; {2484#false} is VALID [2022-04-14 16:17:12,392 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#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)); {2484#false} is VALID [2022-04-14 16:17:12,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-14 16:17:12,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-14 16:17:12,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-14 16:17:12,392 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-14 16:17:12,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:13,020 INFO L290 TraceCheckUtils]: 112: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-04-14 16:17:13,020 INFO L290 TraceCheckUtils]: 111: Hoare triple {2484#false} assume 0 == ~cond; {2484#false} is VALID [2022-04-14 16:17:13,020 INFO L290 TraceCheckUtils]: 110: Hoare triple {2484#false} ~cond := #in~cond; {2484#false} is VALID [2022-04-14 16:17:13,020 INFO L272 TraceCheckUtils]: 109: Hoare triple {2484#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)); {2484#false} is VALID [2022-04-14 16:17:13,021 INFO L290 TraceCheckUtils]: 108: Hoare triple {2848#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2484#false} is VALID [2022-04-14 16:17:13,021 INFO L290 TraceCheckUtils]: 107: Hoare triple {2852#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2848#(< |main_#t~post6| 50)} is VALID [2022-04-14 16:17:13,021 INFO L290 TraceCheckUtils]: 106: Hoare triple {2852#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2852#(< ~counter~0 50)} is VALID [2022-04-14 16:17:13,022 INFO L290 TraceCheckUtils]: 105: Hoare triple {2852#(< ~counter~0 50)} assume !!(0 != ~r~0); {2852#(< ~counter~0 50)} is VALID [2022-04-14 16:17:13,022 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {2483#true} {2852#(< ~counter~0 50)} #63#return; {2852#(< ~counter~0 50)} is VALID [2022-04-14 16:17:13,022 INFO L290 TraceCheckUtils]: 103: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,022 INFO L290 TraceCheckUtils]: 102: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,022 INFO L290 TraceCheckUtils]: 101: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,022 INFO L272 TraceCheckUtils]: 100: Hoare triple {2852#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,023 INFO L290 TraceCheckUtils]: 99: Hoare triple {2852#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2852#(< ~counter~0 50)} is VALID [2022-04-14 16:17:13,023 INFO L290 TraceCheckUtils]: 98: Hoare triple {2880#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2852#(< ~counter~0 50)} is VALID [2022-04-14 16:17:13,023 INFO L290 TraceCheckUtils]: 97: Hoare triple {2880#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2880#(< ~counter~0 49)} is VALID [2022-04-14 16:17:13,024 INFO L290 TraceCheckUtils]: 96: Hoare triple {2880#(< ~counter~0 49)} assume !!(0 != ~r~0); {2880#(< ~counter~0 49)} is VALID [2022-04-14 16:17:13,024 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {2483#true} {2880#(< ~counter~0 49)} #63#return; {2880#(< ~counter~0 49)} is VALID [2022-04-14 16:17:13,024 INFO L290 TraceCheckUtils]: 94: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,024 INFO L290 TraceCheckUtils]: 93: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,024 INFO L290 TraceCheckUtils]: 92: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,024 INFO L272 TraceCheckUtils]: 91: Hoare triple {2880#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,025 INFO L290 TraceCheckUtils]: 90: Hoare triple {2880#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {2880#(< ~counter~0 49)} is VALID [2022-04-14 16:17:13,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {2908#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2880#(< ~counter~0 49)} is VALID [2022-04-14 16:17:13,027 INFO L290 TraceCheckUtils]: 88: Hoare triple {2908#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2908#(< ~counter~0 48)} is VALID [2022-04-14 16:17:13,027 INFO L290 TraceCheckUtils]: 87: Hoare triple {2908#(< ~counter~0 48)} assume !!(0 != ~r~0); {2908#(< ~counter~0 48)} is VALID [2022-04-14 16:17:13,027 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {2483#true} {2908#(< ~counter~0 48)} #63#return; {2908#(< ~counter~0 48)} is VALID [2022-04-14 16:17:13,028 INFO L290 TraceCheckUtils]: 85: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,028 INFO L290 TraceCheckUtils]: 84: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,028 INFO L290 TraceCheckUtils]: 83: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,028 INFO L272 TraceCheckUtils]: 82: Hoare triple {2908#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {2908#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {2908#(< ~counter~0 48)} is VALID [2022-04-14 16:17:13,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {2936#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2908#(< ~counter~0 48)} is VALID [2022-04-14 16:17:13,029 INFO L290 TraceCheckUtils]: 79: Hoare triple {2936#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2936#(< ~counter~0 47)} is VALID [2022-04-14 16:17:13,029 INFO L290 TraceCheckUtils]: 78: Hoare triple {2936#(< ~counter~0 47)} assume !!(0 != ~r~0); {2936#(< ~counter~0 47)} is VALID [2022-04-14 16:17:13,030 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {2483#true} {2936#(< ~counter~0 47)} #63#return; {2936#(< ~counter~0 47)} is VALID [2022-04-14 16:17:13,030 INFO L290 TraceCheckUtils]: 76: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,030 INFO L290 TraceCheckUtils]: 75: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,030 INFO L290 TraceCheckUtils]: 74: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,030 INFO L272 TraceCheckUtils]: 73: Hoare triple {2936#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {2936#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {2936#(< ~counter~0 47)} is VALID [2022-04-14 16:17:13,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {2964#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2936#(< ~counter~0 47)} is VALID [2022-04-14 16:17:13,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {2964#(< ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2964#(< ~counter~0 46)} is VALID [2022-04-14 16:17:13,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {2964#(< ~counter~0 46)} assume !!(0 != ~r~0); {2964#(< ~counter~0 46)} is VALID [2022-04-14 16:17:13,032 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2483#true} {2964#(< ~counter~0 46)} #63#return; {2964#(< ~counter~0 46)} is VALID [2022-04-14 16:17:13,032 INFO L290 TraceCheckUtils]: 67: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,032 INFO L290 TraceCheckUtils]: 66: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,032 INFO L290 TraceCheckUtils]: 65: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,032 INFO L272 TraceCheckUtils]: 64: Hoare triple {2964#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,032 INFO L290 TraceCheckUtils]: 63: Hoare triple {2964#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {2964#(< ~counter~0 46)} is VALID [2022-04-14 16:17:13,033 INFO L290 TraceCheckUtils]: 62: Hoare triple {2992#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2964#(< ~counter~0 46)} is VALID [2022-04-14 16:17:13,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {2992#(< ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2992#(< ~counter~0 45)} is VALID [2022-04-14 16:17:13,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {2992#(< ~counter~0 45)} assume !!(0 != ~r~0); {2992#(< ~counter~0 45)} is VALID [2022-04-14 16:17:13,034 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2483#true} {2992#(< ~counter~0 45)} #63#return; {2992#(< ~counter~0 45)} is VALID [2022-04-14 16:17:13,034 INFO L290 TraceCheckUtils]: 58: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,034 INFO L272 TraceCheckUtils]: 55: Hoare triple {2992#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {2992#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {2992#(< ~counter~0 45)} is VALID [2022-04-14 16:17:13,035 INFO L290 TraceCheckUtils]: 53: Hoare triple {3020#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2992#(< ~counter~0 45)} is VALID [2022-04-14 16:17:13,035 INFO L290 TraceCheckUtils]: 52: Hoare triple {3020#(< ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3020#(< ~counter~0 44)} is VALID [2022-04-14 16:17:13,035 INFO L290 TraceCheckUtils]: 51: Hoare triple {3020#(< ~counter~0 44)} assume !!(0 != ~r~0); {3020#(< ~counter~0 44)} is VALID [2022-04-14 16:17:13,036 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2483#true} {3020#(< ~counter~0 44)} #63#return; {3020#(< ~counter~0 44)} is VALID [2022-04-14 16:17:13,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,036 INFO L290 TraceCheckUtils]: 48: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,036 INFO L272 TraceCheckUtils]: 46: Hoare triple {3020#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {3020#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {3020#(< ~counter~0 44)} is VALID [2022-04-14 16:17:13,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {3048#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3020#(< ~counter~0 44)} is VALID [2022-04-14 16:17:13,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {3048#(< ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3048#(< ~counter~0 43)} is VALID [2022-04-14 16:17:13,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {3048#(< ~counter~0 43)} assume !!(0 != ~r~0); {3048#(< ~counter~0 43)} is VALID [2022-04-14 16:17:13,038 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2483#true} {3048#(< ~counter~0 43)} #63#return; {3048#(< ~counter~0 43)} is VALID [2022-04-14 16:17:13,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,038 INFO L290 TraceCheckUtils]: 39: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,038 INFO L272 TraceCheckUtils]: 37: Hoare triple {3048#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {3048#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {3048#(< ~counter~0 43)} is VALID [2022-04-14 16:17:13,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {3076#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3048#(< ~counter~0 43)} is VALID [2022-04-14 16:17:13,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {3076#(< ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3076#(< ~counter~0 42)} is VALID [2022-04-14 16:17:13,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {3076#(< ~counter~0 42)} assume !!(0 != ~r~0); {3076#(< ~counter~0 42)} is VALID [2022-04-14 16:17:13,040 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2483#true} {3076#(< ~counter~0 42)} #63#return; {3076#(< ~counter~0 42)} is VALID [2022-04-14 16:17:13,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,040 INFO L272 TraceCheckUtils]: 28: Hoare triple {3076#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {3076#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {3076#(< ~counter~0 42)} is VALID [2022-04-14 16:17:13,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {3104#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3076#(< ~counter~0 42)} is VALID [2022-04-14 16:17:13,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {3104#(< ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3104#(< ~counter~0 41)} is VALID [2022-04-14 16:17:13,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {3104#(< ~counter~0 41)} assume !!(0 != ~r~0); {3104#(< ~counter~0 41)} is VALID [2022-04-14 16:17:13,042 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2483#true} {3104#(< ~counter~0 41)} #63#return; {3104#(< ~counter~0 41)} is VALID [2022-04-14 16:17:13,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,042 INFO L272 TraceCheckUtils]: 19: Hoare triple {3104#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {3104#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {3104#(< ~counter~0 41)} is VALID [2022-04-14 16:17:13,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {3132#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3104#(< ~counter~0 41)} is VALID [2022-04-14 16:17:13,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {3132#(< ~counter~0 40)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2483#true} {3132#(< ~counter~0 40)} #61#return; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,044 INFO L272 TraceCheckUtils]: 11: Hoare triple {3132#(< ~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)); {2483#true} is VALID [2022-04-14 16:17:13,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2483#true} {3132#(< ~counter~0 40)} #59#return; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume true; {2483#true} is VALID [2022-04-14 16:17:13,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !(0 == ~cond); {2483#true} is VALID [2022-04-14 16:17:13,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} ~cond := #in~cond; {2483#true} is VALID [2022-04-14 16:17:13,045 INFO L272 TraceCheckUtils]: 6: Hoare triple {3132#(< ~counter~0 40)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2483#true} is VALID [2022-04-14 16:17:13,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {3132#(< ~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; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {3132#(< ~counter~0 40)} call #t~ret7 := main(); {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3132#(< ~counter~0 40)} {2483#true} #67#return; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {3132#(< ~counter~0 40)} assume true; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#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; {3132#(< ~counter~0 40)} is VALID [2022-04-14 16:17:13,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {2483#true} call ULTIMATE.init(); {2483#true} is VALID [2022-04-14 16:17:13,047 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-14 16:17:13,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:13,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585102930] [2022-04-14 16:17:13,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:13,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115984989] [2022-04-14 16:17:13,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115984989] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:13,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:13,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-14 16:17:13,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687624004] [2022-04-14 16:17:13,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:13,051 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-14 16:17:13,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:13,052 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-14 16:17:13,171 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-14 16:17:13,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 16:17:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 16:17:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-14 16:17:13,172 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-14 16:17:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:14,101 INFO L93 Difference]: Finished difference Result 223 states and 257 transitions. [2022-04-14 16:17:14,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-14 16:17:14,102 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-14 16:17:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:14,102 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-14 16:17:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-14 16:17:14,109 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-14 16:17:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 256 transitions. [2022-04-14 16:17:14,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 256 transitions. [2022-04-14 16:17:14,292 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-14 16:17:14,297 INFO L225 Difference]: With dead ends: 223 [2022-04-14 16:17:14,297 INFO L226 Difference]: Without dead ends: 218 [2022-04-14 16:17:14,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-04-14 16:17:14,298 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 232 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:14,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 302 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:17:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-04-14 16:17:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2022-04-14 16:17:14,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:14,368 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-14 16:17:14,368 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-14 16:17:14,369 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-14 16:17:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:14,377 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-14 16:17:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:17:14,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:14,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:14,378 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-14 16:17:14,378 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-14 16:17:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:14,386 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2022-04-14 16:17:14,386 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:17:14,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:14,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:14,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:14,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:14,387 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-14 16:17:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 241 transitions. [2022-04-14 16:17:14,395 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 241 transitions. Word has length 113 [2022-04-14 16:17:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:14,396 INFO L478 AbstractCegarLoop]: Abstraction has 218 states and 241 transitions. [2022-04-14 16:17:14,396 INFO L479 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-14 16:17:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 241 transitions. [2022-04-14 16:17:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-04-14 16:17:14,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:14,398 INFO L499 BasicCegarLoop]: 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-14 16:17:14,403 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-14 16:17:14,603 WARN L460 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-14 16:17:14,603 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:14,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1234385578, now seen corresponding path program 4 times [2022-04-14 16:17:14,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:14,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651521796] [2022-04-14 16:17:14,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:14,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:14,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:14,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179558889] [2022-04-14 16:17:14,638 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-14 16:17:14,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:14,640 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-14 16:17:14,641 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-14 16:17:14,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-14 16:17:14,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:14,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-14 16:17:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:14,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:16,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2022-04-14 16:17:16,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {4259#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; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4267#(<= ~counter~0 0)} {4259#true} #67#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {4267#(<= ~counter~0 0)} call #t~ret7 := main(); {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {4267#(<= ~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; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {4267#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {4267#(<= ~counter~0 0)} ~cond := #in~cond; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {4267#(<= ~counter~0 0)} assume !(0 == ~cond); {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4267#(<= ~counter~0 0)} {4267#(<= ~counter~0 0)} #59#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,190 INFO L272 TraceCheckUtils]: 11: Hoare triple {4267#(<= ~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)); {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {4267#(<= ~counter~0 0)} ~cond := #in~cond; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {4267#(<= ~counter~0 0)} assume !(0 == ~cond); {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {4267#(<= ~counter~0 0)} assume true; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,192 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4267#(<= ~counter~0 0)} {4267#(<= ~counter~0 0)} #61#return; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {4267#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4267#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:16,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {4267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {4316#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,193 INFO L272 TraceCheckUtils]: 19: Hoare triple {4316#(<= ~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)); {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {4316#(<= ~counter~0 1)} ~cond := #in~cond; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {4316#(<= ~counter~0 1)} assume !(0 == ~cond); {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {4316#(<= ~counter~0 1)} assume true; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,194 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4316#(<= ~counter~0 1)} {4316#(<= ~counter~0 1)} #63#return; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {4316#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,195 INFO L290 TraceCheckUtils]: 25: Hoare triple {4316#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4316#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:16,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {4316#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {4344#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,196 INFO L272 TraceCheckUtils]: 28: Hoare triple {4344#(<= ~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)); {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {4344#(<= ~counter~0 2)} ~cond := #in~cond; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {4344#(<= ~counter~0 2)} assume !(0 == ~cond); {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {4344#(<= ~counter~0 2)} assume true; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,197 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4344#(<= ~counter~0 2)} {4344#(<= ~counter~0 2)} #63#return; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {4344#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {4344#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4344#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:16,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {4344#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {4372#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,199 INFO L272 TraceCheckUtils]: 37: Hoare triple {4372#(<= ~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)); {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {4372#(<= ~counter~0 3)} ~cond := #in~cond; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {4372#(<= ~counter~0 3)} assume !(0 == ~cond); {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {4372#(<= ~counter~0 3)} assume true; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,200 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4372#(<= ~counter~0 3)} {4372#(<= ~counter~0 3)} #63#return; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {4372#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,200 INFO L290 TraceCheckUtils]: 43: Hoare triple {4372#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4372#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:16,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {4372#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,201 INFO L290 TraceCheckUtils]: 45: Hoare triple {4400#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,202 INFO L272 TraceCheckUtils]: 46: Hoare triple {4400#(<= ~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)); {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {4400#(<= ~counter~0 4)} ~cond := #in~cond; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {4400#(<= ~counter~0 4)} assume !(0 == ~cond); {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,202 INFO L290 TraceCheckUtils]: 49: Hoare triple {4400#(<= ~counter~0 4)} assume true; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,203 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4400#(<= ~counter~0 4)} {4400#(<= ~counter~0 4)} #63#return; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {4400#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {4400#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4400#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:16,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {4400#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {4428#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,204 INFO L272 TraceCheckUtils]: 55: Hoare triple {4428#(<= ~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)); {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {4428#(<= ~counter~0 5)} ~cond := #in~cond; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,205 INFO L290 TraceCheckUtils]: 57: Hoare triple {4428#(<= ~counter~0 5)} assume !(0 == ~cond); {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,205 INFO L290 TraceCheckUtils]: 58: Hoare triple {4428#(<= ~counter~0 5)} assume true; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,205 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4428#(<= ~counter~0 5)} {4428#(<= ~counter~0 5)} #63#return; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {4428#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {4428#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4428#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:16,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {4428#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {4456#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,207 INFO L272 TraceCheckUtils]: 64: Hoare triple {4456#(<= ~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)); {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {4456#(<= ~counter~0 6)} ~cond := #in~cond; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,207 INFO L290 TraceCheckUtils]: 66: Hoare triple {4456#(<= ~counter~0 6)} assume !(0 == ~cond); {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {4456#(<= ~counter~0 6)} assume true; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,208 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4456#(<= ~counter~0 6)} {4456#(<= ~counter~0 6)} #63#return; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,208 INFO L290 TraceCheckUtils]: 69: Hoare triple {4456#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {4456#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4456#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:16,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {4456#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {4484#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,210 INFO L272 TraceCheckUtils]: 73: Hoare triple {4484#(<= ~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)); {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {4484#(<= ~counter~0 7)} ~cond := #in~cond; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {4484#(<= ~counter~0 7)} assume !(0 == ~cond); {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {4484#(<= ~counter~0 7)} assume true; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,211 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4484#(<= ~counter~0 7)} {4484#(<= ~counter~0 7)} #63#return; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,211 INFO L290 TraceCheckUtils]: 78: Hoare triple {4484#(<= ~counter~0 7)} assume !!(0 != ~r~0); {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,211 INFO L290 TraceCheckUtils]: 79: Hoare triple {4484#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4484#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:16,212 INFO L290 TraceCheckUtils]: 80: Hoare triple {4484#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,212 INFO L290 TraceCheckUtils]: 81: Hoare triple {4512#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,212 INFO L272 TraceCheckUtils]: 82: Hoare triple {4512#(<= ~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)); {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,213 INFO L290 TraceCheckUtils]: 83: Hoare triple {4512#(<= ~counter~0 8)} ~cond := #in~cond; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,213 INFO L290 TraceCheckUtils]: 84: Hoare triple {4512#(<= ~counter~0 8)} assume !(0 == ~cond); {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,213 INFO L290 TraceCheckUtils]: 85: Hoare triple {4512#(<= ~counter~0 8)} assume true; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,213 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4512#(<= ~counter~0 8)} {4512#(<= ~counter~0 8)} #63#return; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,214 INFO L290 TraceCheckUtils]: 87: Hoare triple {4512#(<= ~counter~0 8)} assume !!(0 != ~r~0); {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,214 INFO L290 TraceCheckUtils]: 88: Hoare triple {4512#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4512#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:16,214 INFO L290 TraceCheckUtils]: 89: Hoare triple {4512#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,215 INFO L290 TraceCheckUtils]: 90: Hoare triple {4540#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,215 INFO L272 TraceCheckUtils]: 91: Hoare triple {4540#(<= ~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)); {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,216 INFO L290 TraceCheckUtils]: 92: Hoare triple {4540#(<= ~counter~0 9)} ~cond := #in~cond; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,216 INFO L290 TraceCheckUtils]: 93: Hoare triple {4540#(<= ~counter~0 9)} assume !(0 == ~cond); {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,217 INFO L290 TraceCheckUtils]: 94: Hoare triple {4540#(<= ~counter~0 9)} assume true; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,217 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4540#(<= ~counter~0 9)} {4540#(<= ~counter~0 9)} #63#return; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,217 INFO L290 TraceCheckUtils]: 96: Hoare triple {4540#(<= ~counter~0 9)} assume !!(0 != ~r~0); {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,217 INFO L290 TraceCheckUtils]: 97: Hoare triple {4540#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4540#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:16,218 INFO L290 TraceCheckUtils]: 98: Hoare triple {4540#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,218 INFO L290 TraceCheckUtils]: 99: Hoare triple {4568#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,218 INFO L272 TraceCheckUtils]: 100: Hoare triple {4568#(<= ~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)); {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,219 INFO L290 TraceCheckUtils]: 101: Hoare triple {4568#(<= ~counter~0 10)} ~cond := #in~cond; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,219 INFO L290 TraceCheckUtils]: 102: Hoare triple {4568#(<= ~counter~0 10)} assume !(0 == ~cond); {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,219 INFO L290 TraceCheckUtils]: 103: Hoare triple {4568#(<= ~counter~0 10)} assume true; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,220 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4568#(<= ~counter~0 10)} {4568#(<= ~counter~0 10)} #63#return; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,220 INFO L290 TraceCheckUtils]: 105: Hoare triple {4568#(<= ~counter~0 10)} assume !!(0 != ~r~0); {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,220 INFO L290 TraceCheckUtils]: 106: Hoare triple {4568#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4568#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:16,220 INFO L290 TraceCheckUtils]: 107: Hoare triple {4568#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,221 INFO L290 TraceCheckUtils]: 108: Hoare triple {4596#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,221 INFO L272 TraceCheckUtils]: 109: Hoare triple {4596#(<= ~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)); {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,221 INFO L290 TraceCheckUtils]: 110: Hoare triple {4596#(<= ~counter~0 11)} ~cond := #in~cond; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,222 INFO L290 TraceCheckUtils]: 111: Hoare triple {4596#(<= ~counter~0 11)} assume !(0 == ~cond); {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,222 INFO L290 TraceCheckUtils]: 112: Hoare triple {4596#(<= ~counter~0 11)} assume true; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,222 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4596#(<= ~counter~0 11)} {4596#(<= ~counter~0 11)} #63#return; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,223 INFO L290 TraceCheckUtils]: 114: Hoare triple {4596#(<= ~counter~0 11)} assume !!(0 != ~r~0); {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,223 INFO L290 TraceCheckUtils]: 115: Hoare triple {4596#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4596#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:16,223 INFO L290 TraceCheckUtils]: 116: Hoare triple {4596#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,223 INFO L290 TraceCheckUtils]: 117: Hoare triple {4624#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,224 INFO L272 TraceCheckUtils]: 118: Hoare triple {4624#(<= ~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)); {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,224 INFO L290 TraceCheckUtils]: 119: Hoare triple {4624#(<= ~counter~0 12)} ~cond := #in~cond; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,224 INFO L290 TraceCheckUtils]: 120: Hoare triple {4624#(<= ~counter~0 12)} assume !(0 == ~cond); {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,224 INFO L290 TraceCheckUtils]: 121: Hoare triple {4624#(<= ~counter~0 12)} assume true; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,225 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4624#(<= ~counter~0 12)} {4624#(<= ~counter~0 12)} #63#return; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,225 INFO L290 TraceCheckUtils]: 123: Hoare triple {4624#(<= ~counter~0 12)} assume !!(0 != ~r~0); {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,225 INFO L290 TraceCheckUtils]: 124: Hoare triple {4624#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4624#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:16,226 INFO L290 TraceCheckUtils]: 125: Hoare triple {4624#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,226 INFO L290 TraceCheckUtils]: 126: Hoare triple {4652#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,226 INFO L272 TraceCheckUtils]: 127: Hoare triple {4652#(<= ~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)); {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,227 INFO L290 TraceCheckUtils]: 128: Hoare triple {4652#(<= ~counter~0 13)} ~cond := #in~cond; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,227 INFO L290 TraceCheckUtils]: 129: Hoare triple {4652#(<= ~counter~0 13)} assume !(0 == ~cond); {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,227 INFO L290 TraceCheckUtils]: 130: Hoare triple {4652#(<= ~counter~0 13)} assume true; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,228 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4652#(<= ~counter~0 13)} {4652#(<= ~counter~0 13)} #63#return; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,228 INFO L290 TraceCheckUtils]: 132: Hoare triple {4652#(<= ~counter~0 13)} assume !!(0 != ~r~0); {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,228 INFO L290 TraceCheckUtils]: 133: Hoare triple {4652#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4652#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:16,228 INFO L290 TraceCheckUtils]: 134: Hoare triple {4652#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,229 INFO L290 TraceCheckUtils]: 135: Hoare triple {4680#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,229 INFO L272 TraceCheckUtils]: 136: Hoare triple {4680#(<= ~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)); {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,229 INFO L290 TraceCheckUtils]: 137: Hoare triple {4680#(<= ~counter~0 14)} ~cond := #in~cond; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,230 INFO L290 TraceCheckUtils]: 138: Hoare triple {4680#(<= ~counter~0 14)} assume !(0 == ~cond); {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,230 INFO L290 TraceCheckUtils]: 139: Hoare triple {4680#(<= ~counter~0 14)} assume true; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,230 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4680#(<= ~counter~0 14)} {4680#(<= ~counter~0 14)} #63#return; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,230 INFO L290 TraceCheckUtils]: 141: Hoare triple {4680#(<= ~counter~0 14)} assume !!(0 != ~r~0); {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,231 INFO L290 TraceCheckUtils]: 142: Hoare triple {4680#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4680#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:16,231 INFO L290 TraceCheckUtils]: 143: Hoare triple {4680#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,231 INFO L290 TraceCheckUtils]: 144: Hoare triple {4708#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,232 INFO L272 TraceCheckUtils]: 145: Hoare triple {4708#(<= ~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)); {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,232 INFO L290 TraceCheckUtils]: 146: Hoare triple {4708#(<= ~counter~0 15)} ~cond := #in~cond; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,232 INFO L290 TraceCheckUtils]: 147: Hoare triple {4708#(<= ~counter~0 15)} assume !(0 == ~cond); {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,232 INFO L290 TraceCheckUtils]: 148: Hoare triple {4708#(<= ~counter~0 15)} assume true; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,233 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4708#(<= ~counter~0 15)} {4708#(<= ~counter~0 15)} #63#return; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,233 INFO L290 TraceCheckUtils]: 150: Hoare triple {4708#(<= ~counter~0 15)} assume !!(0 != ~r~0); {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,233 INFO L290 TraceCheckUtils]: 151: Hoare triple {4708#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4708#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:16,234 INFO L290 TraceCheckUtils]: 152: Hoare triple {4708#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,234 INFO L290 TraceCheckUtils]: 153: Hoare triple {4736#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,234 INFO L272 TraceCheckUtils]: 154: Hoare triple {4736#(<= ~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)); {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,235 INFO L290 TraceCheckUtils]: 155: Hoare triple {4736#(<= ~counter~0 16)} ~cond := #in~cond; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,235 INFO L290 TraceCheckUtils]: 156: Hoare triple {4736#(<= ~counter~0 16)} assume !(0 == ~cond); {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,235 INFO L290 TraceCheckUtils]: 157: Hoare triple {4736#(<= ~counter~0 16)} assume true; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,235 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4736#(<= ~counter~0 16)} {4736#(<= ~counter~0 16)} #63#return; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,237 INFO L290 TraceCheckUtils]: 159: Hoare triple {4736#(<= ~counter~0 16)} assume !!(0 != ~r~0); {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,237 INFO L290 TraceCheckUtils]: 160: Hoare triple {4736#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4736#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:16,237 INFO L290 TraceCheckUtils]: 161: Hoare triple {4736#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,237 INFO L290 TraceCheckUtils]: 162: Hoare triple {4764#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,238 INFO L272 TraceCheckUtils]: 163: Hoare triple {4764#(<= ~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)); {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,238 INFO L290 TraceCheckUtils]: 164: Hoare triple {4764#(<= ~counter~0 17)} ~cond := #in~cond; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,238 INFO L290 TraceCheckUtils]: 165: Hoare triple {4764#(<= ~counter~0 17)} assume !(0 == ~cond); {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,239 INFO L290 TraceCheckUtils]: 166: Hoare triple {4764#(<= ~counter~0 17)} assume true; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,239 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4764#(<= ~counter~0 17)} {4764#(<= ~counter~0 17)} #63#return; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,239 INFO L290 TraceCheckUtils]: 168: Hoare triple {4764#(<= ~counter~0 17)} assume !!(0 != ~r~0); {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,239 INFO L290 TraceCheckUtils]: 169: Hoare triple {4764#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4764#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:16,240 INFO L290 TraceCheckUtils]: 170: Hoare triple {4764#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,240 INFO L290 TraceCheckUtils]: 171: Hoare triple {4792#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,241 INFO L272 TraceCheckUtils]: 172: Hoare triple {4792#(<= ~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)); {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,241 INFO L290 TraceCheckUtils]: 173: Hoare triple {4792#(<= ~counter~0 18)} ~cond := #in~cond; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,241 INFO L290 TraceCheckUtils]: 174: Hoare triple {4792#(<= ~counter~0 18)} assume !(0 == ~cond); {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,241 INFO L290 TraceCheckUtils]: 175: Hoare triple {4792#(<= ~counter~0 18)} assume true; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,242 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4792#(<= ~counter~0 18)} {4792#(<= ~counter~0 18)} #63#return; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,242 INFO L290 TraceCheckUtils]: 177: Hoare triple {4792#(<= ~counter~0 18)} assume !!(0 != ~r~0); {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,242 INFO L290 TraceCheckUtils]: 178: Hoare triple {4792#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4792#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:16,243 INFO L290 TraceCheckUtils]: 179: Hoare triple {4792#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,243 INFO L290 TraceCheckUtils]: 180: Hoare triple {4820#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,243 INFO L272 TraceCheckUtils]: 181: Hoare triple {4820#(<= ~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)); {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,244 INFO L290 TraceCheckUtils]: 182: Hoare triple {4820#(<= ~counter~0 19)} ~cond := #in~cond; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,244 INFO L290 TraceCheckUtils]: 183: Hoare triple {4820#(<= ~counter~0 19)} assume !(0 == ~cond); {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,244 INFO L290 TraceCheckUtils]: 184: Hoare triple {4820#(<= ~counter~0 19)} assume true; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,244 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4820#(<= ~counter~0 19)} {4820#(<= ~counter~0 19)} #63#return; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,245 INFO L290 TraceCheckUtils]: 186: Hoare triple {4820#(<= ~counter~0 19)} assume !!(0 != ~r~0); {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,245 INFO L290 TraceCheckUtils]: 187: Hoare triple {4820#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4820#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:16,245 INFO L290 TraceCheckUtils]: 188: Hoare triple {4820#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,246 INFO L290 TraceCheckUtils]: 189: Hoare triple {4848#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,246 INFO L272 TraceCheckUtils]: 190: Hoare triple {4848#(<= ~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)); {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,246 INFO L290 TraceCheckUtils]: 191: Hoare triple {4848#(<= ~counter~0 20)} ~cond := #in~cond; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,246 INFO L290 TraceCheckUtils]: 192: Hoare triple {4848#(<= ~counter~0 20)} assume !(0 == ~cond); {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,247 INFO L290 TraceCheckUtils]: 193: Hoare triple {4848#(<= ~counter~0 20)} assume true; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,247 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4848#(<= ~counter~0 20)} {4848#(<= ~counter~0 20)} #63#return; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,247 INFO L290 TraceCheckUtils]: 195: Hoare triple {4848#(<= ~counter~0 20)} assume !!(0 != ~r~0); {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,248 INFO L290 TraceCheckUtils]: 196: Hoare triple {4848#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4848#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:16,248 INFO L290 TraceCheckUtils]: 197: Hoare triple {4848#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,248 INFO L290 TraceCheckUtils]: 198: Hoare triple {4876#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,249 INFO L272 TraceCheckUtils]: 199: Hoare triple {4876#(<= ~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)); {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,249 INFO L290 TraceCheckUtils]: 200: Hoare triple {4876#(<= ~counter~0 21)} ~cond := #in~cond; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,249 INFO L290 TraceCheckUtils]: 201: Hoare triple {4876#(<= ~counter~0 21)} assume !(0 == ~cond); {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,250 INFO L290 TraceCheckUtils]: 202: Hoare triple {4876#(<= ~counter~0 21)} assume true; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,250 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4876#(<= ~counter~0 21)} {4876#(<= ~counter~0 21)} #63#return; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,250 INFO L290 TraceCheckUtils]: 204: Hoare triple {4876#(<= ~counter~0 21)} assume !!(0 != ~r~0); {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,251 INFO L290 TraceCheckUtils]: 205: Hoare triple {4876#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4876#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:16,251 INFO L290 TraceCheckUtils]: 206: Hoare triple {4876#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,251 INFO L290 TraceCheckUtils]: 207: Hoare triple {4904#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,252 INFO L272 TraceCheckUtils]: 208: Hoare triple {4904#(<= ~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)); {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,252 INFO L290 TraceCheckUtils]: 209: Hoare triple {4904#(<= ~counter~0 22)} ~cond := #in~cond; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,252 INFO L290 TraceCheckUtils]: 210: Hoare triple {4904#(<= ~counter~0 22)} assume !(0 == ~cond); {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,252 INFO L290 TraceCheckUtils]: 211: Hoare triple {4904#(<= ~counter~0 22)} assume true; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,253 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4904#(<= ~counter~0 22)} {4904#(<= ~counter~0 22)} #63#return; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,253 INFO L290 TraceCheckUtils]: 213: Hoare triple {4904#(<= ~counter~0 22)} assume !!(0 != ~r~0); {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,253 INFO L290 TraceCheckUtils]: 214: Hoare triple {4904#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4904#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:16,254 INFO L290 TraceCheckUtils]: 215: Hoare triple {4904#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4932#(<= |main_#t~post6| 22)} is VALID [2022-04-14 16:17:16,254 INFO L290 TraceCheckUtils]: 216: Hoare triple {4932#(<= |main_#t~post6| 22)} assume !(#t~post6 < 50);havoc #t~post6; {4260#false} is VALID [2022-04-14 16:17:16,254 INFO L272 TraceCheckUtils]: 217: Hoare triple {4260#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)); {4260#false} is VALID [2022-04-14 16:17:16,254 INFO L290 TraceCheckUtils]: 218: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2022-04-14 16:17:16,254 INFO L290 TraceCheckUtils]: 219: Hoare triple {4260#false} assume 0 == ~cond; {4260#false} is VALID [2022-04-14 16:17:16,254 INFO L290 TraceCheckUtils]: 220: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2022-04-14 16:17:16,256 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-14 16:17:16,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:17,775 INFO L290 TraceCheckUtils]: 220: Hoare triple {4260#false} assume !false; {4260#false} is VALID [2022-04-14 16:17:17,775 INFO L290 TraceCheckUtils]: 219: Hoare triple {4260#false} assume 0 == ~cond; {4260#false} is VALID [2022-04-14 16:17:17,775 INFO L290 TraceCheckUtils]: 218: Hoare triple {4260#false} ~cond := #in~cond; {4260#false} is VALID [2022-04-14 16:17:17,775 INFO L272 TraceCheckUtils]: 217: Hoare triple {4260#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)); {4260#false} is VALID [2022-04-14 16:17:17,775 INFO L290 TraceCheckUtils]: 216: Hoare triple {4960#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {4260#false} is VALID [2022-04-14 16:17:17,776 INFO L290 TraceCheckUtils]: 215: Hoare triple {4964#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4960#(< |main_#t~post6| 50)} is VALID [2022-04-14 16:17:17,776 INFO L290 TraceCheckUtils]: 214: Hoare triple {4964#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4964#(< ~counter~0 50)} is VALID [2022-04-14 16:17:17,776 INFO L290 TraceCheckUtils]: 213: Hoare triple {4964#(< ~counter~0 50)} assume !!(0 != ~r~0); {4964#(< ~counter~0 50)} is VALID [2022-04-14 16:17:17,776 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {4259#true} {4964#(< ~counter~0 50)} #63#return; {4964#(< ~counter~0 50)} is VALID [2022-04-14 16:17:17,776 INFO L290 TraceCheckUtils]: 211: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,777 INFO L290 TraceCheckUtils]: 210: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,777 INFO L290 TraceCheckUtils]: 209: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,777 INFO L272 TraceCheckUtils]: 208: Hoare triple {4964#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,791 INFO L290 TraceCheckUtils]: 207: Hoare triple {4964#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {4964#(< ~counter~0 50)} is VALID [2022-04-14 16:17:17,792 INFO L290 TraceCheckUtils]: 206: Hoare triple {4992#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4964#(< ~counter~0 50)} is VALID [2022-04-14 16:17:17,792 INFO L290 TraceCheckUtils]: 205: Hoare triple {4992#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4992#(< ~counter~0 49)} is VALID [2022-04-14 16:17:17,792 INFO L290 TraceCheckUtils]: 204: Hoare triple {4992#(< ~counter~0 49)} assume !!(0 != ~r~0); {4992#(< ~counter~0 49)} is VALID [2022-04-14 16:17:17,793 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {4259#true} {4992#(< ~counter~0 49)} #63#return; {4992#(< ~counter~0 49)} is VALID [2022-04-14 16:17:17,793 INFO L290 TraceCheckUtils]: 202: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,793 INFO L290 TraceCheckUtils]: 201: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,793 INFO L290 TraceCheckUtils]: 200: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,793 INFO L272 TraceCheckUtils]: 199: Hoare triple {4992#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,793 INFO L290 TraceCheckUtils]: 198: Hoare triple {4992#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4992#(< ~counter~0 49)} is VALID [2022-04-14 16:17:17,794 INFO L290 TraceCheckUtils]: 197: Hoare triple {5020#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4992#(< ~counter~0 49)} is VALID [2022-04-14 16:17:17,794 INFO L290 TraceCheckUtils]: 196: Hoare triple {5020#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5020#(< ~counter~0 48)} is VALID [2022-04-14 16:17:17,794 INFO L290 TraceCheckUtils]: 195: Hoare triple {5020#(< ~counter~0 48)} assume !!(0 != ~r~0); {5020#(< ~counter~0 48)} is VALID [2022-04-14 16:17:17,794 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {4259#true} {5020#(< ~counter~0 48)} #63#return; {5020#(< ~counter~0 48)} is VALID [2022-04-14 16:17:17,794 INFO L290 TraceCheckUtils]: 193: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,795 INFO L290 TraceCheckUtils]: 192: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,795 INFO L290 TraceCheckUtils]: 191: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,795 INFO L272 TraceCheckUtils]: 190: Hoare triple {5020#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,795 INFO L290 TraceCheckUtils]: 189: Hoare triple {5020#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {5020#(< ~counter~0 48)} is VALID [2022-04-14 16:17:17,795 INFO L290 TraceCheckUtils]: 188: Hoare triple {5048#(< ~counter~0 47)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5020#(< ~counter~0 48)} is VALID [2022-04-14 16:17:17,795 INFO L290 TraceCheckUtils]: 187: Hoare triple {5048#(< ~counter~0 47)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5048#(< ~counter~0 47)} is VALID [2022-04-14 16:17:17,796 INFO L290 TraceCheckUtils]: 186: Hoare triple {5048#(< ~counter~0 47)} assume !!(0 != ~r~0); {5048#(< ~counter~0 47)} is VALID [2022-04-14 16:17:17,796 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {4259#true} {5048#(< ~counter~0 47)} #63#return; {5048#(< ~counter~0 47)} is VALID [2022-04-14 16:17:17,796 INFO L290 TraceCheckUtils]: 184: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,796 INFO L290 TraceCheckUtils]: 183: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,796 INFO L290 TraceCheckUtils]: 182: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,796 INFO L272 TraceCheckUtils]: 181: Hoare triple {5048#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,797 INFO L290 TraceCheckUtils]: 180: Hoare triple {5048#(< ~counter~0 47)} assume !!(#t~post6 < 50);havoc #t~post6; {5048#(< ~counter~0 47)} is VALID [2022-04-14 16:17:17,797 INFO L290 TraceCheckUtils]: 179: Hoare triple {5076#(< ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5048#(< ~counter~0 47)} is VALID [2022-04-14 16:17:17,797 INFO L290 TraceCheckUtils]: 178: Hoare triple {5076#(< ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5076#(< ~counter~0 46)} is VALID [2022-04-14 16:17:17,797 INFO L290 TraceCheckUtils]: 177: Hoare triple {5076#(< ~counter~0 46)} assume !!(0 != ~r~0); {5076#(< ~counter~0 46)} is VALID [2022-04-14 16:17:17,798 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {4259#true} {5076#(< ~counter~0 46)} #63#return; {5076#(< ~counter~0 46)} is VALID [2022-04-14 16:17:17,798 INFO L290 TraceCheckUtils]: 175: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,798 INFO L290 TraceCheckUtils]: 174: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,798 INFO L290 TraceCheckUtils]: 173: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,798 INFO L272 TraceCheckUtils]: 172: Hoare triple {5076#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,798 INFO L290 TraceCheckUtils]: 171: Hoare triple {5076#(< ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {5076#(< ~counter~0 46)} is VALID [2022-04-14 16:17:17,799 INFO L290 TraceCheckUtils]: 170: Hoare triple {5104#(< ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5076#(< ~counter~0 46)} is VALID [2022-04-14 16:17:17,799 INFO L290 TraceCheckUtils]: 169: Hoare triple {5104#(< ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5104#(< ~counter~0 45)} is VALID [2022-04-14 16:17:17,799 INFO L290 TraceCheckUtils]: 168: Hoare triple {5104#(< ~counter~0 45)} assume !!(0 != ~r~0); {5104#(< ~counter~0 45)} is VALID [2022-04-14 16:17:17,799 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {4259#true} {5104#(< ~counter~0 45)} #63#return; {5104#(< ~counter~0 45)} is VALID [2022-04-14 16:17:17,799 INFO L290 TraceCheckUtils]: 166: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,799 INFO L290 TraceCheckUtils]: 165: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,800 INFO L290 TraceCheckUtils]: 164: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,800 INFO L272 TraceCheckUtils]: 163: Hoare triple {5104#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,802 INFO L290 TraceCheckUtils]: 162: Hoare triple {5104#(< ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {5104#(< ~counter~0 45)} is VALID [2022-04-14 16:17:17,802 INFO L290 TraceCheckUtils]: 161: Hoare triple {5132#(< ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5104#(< ~counter~0 45)} is VALID [2022-04-14 16:17:17,802 INFO L290 TraceCheckUtils]: 160: Hoare triple {5132#(< ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5132#(< ~counter~0 44)} is VALID [2022-04-14 16:17:17,802 INFO L290 TraceCheckUtils]: 159: Hoare triple {5132#(< ~counter~0 44)} assume !!(0 != ~r~0); {5132#(< ~counter~0 44)} is VALID [2022-04-14 16:17:17,803 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {4259#true} {5132#(< ~counter~0 44)} #63#return; {5132#(< ~counter~0 44)} is VALID [2022-04-14 16:17:17,803 INFO L290 TraceCheckUtils]: 157: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,803 INFO L290 TraceCheckUtils]: 156: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,803 INFO L290 TraceCheckUtils]: 155: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,803 INFO L272 TraceCheckUtils]: 154: Hoare triple {5132#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,803 INFO L290 TraceCheckUtils]: 153: Hoare triple {5132#(< ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {5132#(< ~counter~0 44)} is VALID [2022-04-14 16:17:17,804 INFO L290 TraceCheckUtils]: 152: Hoare triple {5160#(< ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5132#(< ~counter~0 44)} is VALID [2022-04-14 16:17:17,804 INFO L290 TraceCheckUtils]: 151: Hoare triple {5160#(< ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5160#(< ~counter~0 43)} is VALID [2022-04-14 16:17:17,804 INFO L290 TraceCheckUtils]: 150: Hoare triple {5160#(< ~counter~0 43)} assume !!(0 != ~r~0); {5160#(< ~counter~0 43)} is VALID [2022-04-14 16:17:17,805 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {4259#true} {5160#(< ~counter~0 43)} #63#return; {5160#(< ~counter~0 43)} is VALID [2022-04-14 16:17:17,805 INFO L290 TraceCheckUtils]: 148: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,805 INFO L290 TraceCheckUtils]: 147: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,805 INFO L290 TraceCheckUtils]: 146: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,805 INFO L272 TraceCheckUtils]: 145: Hoare triple {5160#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,805 INFO L290 TraceCheckUtils]: 144: Hoare triple {5160#(< ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {5160#(< ~counter~0 43)} is VALID [2022-04-14 16:17:17,805 INFO L290 TraceCheckUtils]: 143: Hoare triple {5188#(< ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5160#(< ~counter~0 43)} is VALID [2022-04-14 16:17:17,806 INFO L290 TraceCheckUtils]: 142: Hoare triple {5188#(< ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5188#(< ~counter~0 42)} is VALID [2022-04-14 16:17:17,806 INFO L290 TraceCheckUtils]: 141: Hoare triple {5188#(< ~counter~0 42)} assume !!(0 != ~r~0); {5188#(< ~counter~0 42)} is VALID [2022-04-14 16:17:17,807 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {4259#true} {5188#(< ~counter~0 42)} #63#return; {5188#(< ~counter~0 42)} is VALID [2022-04-14 16:17:17,807 INFO L290 TraceCheckUtils]: 139: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,807 INFO L290 TraceCheckUtils]: 138: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,807 INFO L290 TraceCheckUtils]: 137: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,807 INFO L272 TraceCheckUtils]: 136: Hoare triple {5188#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,807 INFO L290 TraceCheckUtils]: 135: Hoare triple {5188#(< ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {5188#(< ~counter~0 42)} is VALID [2022-04-14 16:17:17,808 INFO L290 TraceCheckUtils]: 134: Hoare triple {5216#(< ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5188#(< ~counter~0 42)} is VALID [2022-04-14 16:17:17,808 INFO L290 TraceCheckUtils]: 133: Hoare triple {5216#(< ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5216#(< ~counter~0 41)} is VALID [2022-04-14 16:17:17,808 INFO L290 TraceCheckUtils]: 132: Hoare triple {5216#(< ~counter~0 41)} assume !!(0 != ~r~0); {5216#(< ~counter~0 41)} is VALID [2022-04-14 16:17:17,808 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {4259#true} {5216#(< ~counter~0 41)} #63#return; {5216#(< ~counter~0 41)} is VALID [2022-04-14 16:17:17,808 INFO L290 TraceCheckUtils]: 130: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,809 INFO L290 TraceCheckUtils]: 129: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,809 INFO L290 TraceCheckUtils]: 128: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,809 INFO L272 TraceCheckUtils]: 127: Hoare triple {5216#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,809 INFO L290 TraceCheckUtils]: 126: Hoare triple {5216#(< ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {5216#(< ~counter~0 41)} is VALID [2022-04-14 16:17:17,809 INFO L290 TraceCheckUtils]: 125: Hoare triple {5244#(< ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5216#(< ~counter~0 41)} is VALID [2022-04-14 16:17:17,809 INFO L290 TraceCheckUtils]: 124: Hoare triple {5244#(< ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5244#(< ~counter~0 40)} is VALID [2022-04-14 16:17:17,810 INFO L290 TraceCheckUtils]: 123: Hoare triple {5244#(< ~counter~0 40)} assume !!(0 != ~r~0); {5244#(< ~counter~0 40)} is VALID [2022-04-14 16:17:17,810 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {4259#true} {5244#(< ~counter~0 40)} #63#return; {5244#(< ~counter~0 40)} is VALID [2022-04-14 16:17:17,810 INFO L290 TraceCheckUtils]: 121: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,810 INFO L290 TraceCheckUtils]: 120: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,810 INFO L290 TraceCheckUtils]: 119: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,810 INFO L272 TraceCheckUtils]: 118: Hoare triple {5244#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,810 INFO L290 TraceCheckUtils]: 117: Hoare triple {5244#(< ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {5244#(< ~counter~0 40)} is VALID [2022-04-14 16:17:17,811 INFO L290 TraceCheckUtils]: 116: Hoare triple {5272#(< ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5244#(< ~counter~0 40)} is VALID [2022-04-14 16:17:17,811 INFO L290 TraceCheckUtils]: 115: Hoare triple {5272#(< ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5272#(< ~counter~0 39)} is VALID [2022-04-14 16:17:17,811 INFO L290 TraceCheckUtils]: 114: Hoare triple {5272#(< ~counter~0 39)} assume !!(0 != ~r~0); {5272#(< ~counter~0 39)} is VALID [2022-04-14 16:17:17,812 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {4259#true} {5272#(< ~counter~0 39)} #63#return; {5272#(< ~counter~0 39)} is VALID [2022-04-14 16:17:17,812 INFO L290 TraceCheckUtils]: 112: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,812 INFO L290 TraceCheckUtils]: 111: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,812 INFO L290 TraceCheckUtils]: 110: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,812 INFO L272 TraceCheckUtils]: 109: Hoare triple {5272#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,812 INFO L290 TraceCheckUtils]: 108: Hoare triple {5272#(< ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {5272#(< ~counter~0 39)} is VALID [2022-04-14 16:17:17,812 INFO L290 TraceCheckUtils]: 107: Hoare triple {5300#(< ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5272#(< ~counter~0 39)} is VALID [2022-04-14 16:17:17,813 INFO L290 TraceCheckUtils]: 106: Hoare triple {5300#(< ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5300#(< ~counter~0 38)} is VALID [2022-04-14 16:17:17,813 INFO L290 TraceCheckUtils]: 105: Hoare triple {5300#(< ~counter~0 38)} assume !!(0 != ~r~0); {5300#(< ~counter~0 38)} is VALID [2022-04-14 16:17:17,813 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {4259#true} {5300#(< ~counter~0 38)} #63#return; {5300#(< ~counter~0 38)} is VALID [2022-04-14 16:17:17,813 INFO L290 TraceCheckUtils]: 103: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,813 INFO L290 TraceCheckUtils]: 102: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,814 INFO L290 TraceCheckUtils]: 101: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,814 INFO L272 TraceCheckUtils]: 100: Hoare triple {5300#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,814 INFO L290 TraceCheckUtils]: 99: Hoare triple {5300#(< ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {5300#(< ~counter~0 38)} is VALID [2022-04-14 16:17:17,814 INFO L290 TraceCheckUtils]: 98: Hoare triple {5328#(< ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5300#(< ~counter~0 38)} is VALID [2022-04-14 16:17:17,814 INFO L290 TraceCheckUtils]: 97: Hoare triple {5328#(< ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5328#(< ~counter~0 37)} is VALID [2022-04-14 16:17:17,815 INFO L290 TraceCheckUtils]: 96: Hoare triple {5328#(< ~counter~0 37)} assume !!(0 != ~r~0); {5328#(< ~counter~0 37)} is VALID [2022-04-14 16:17:17,815 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {4259#true} {5328#(< ~counter~0 37)} #63#return; {5328#(< ~counter~0 37)} is VALID [2022-04-14 16:17:17,815 INFO L290 TraceCheckUtils]: 94: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,815 INFO L290 TraceCheckUtils]: 93: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,815 INFO L290 TraceCheckUtils]: 92: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,815 INFO L272 TraceCheckUtils]: 91: Hoare triple {5328#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {5328#(< ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {5328#(< ~counter~0 37)} is VALID [2022-04-14 16:17:17,816 INFO L290 TraceCheckUtils]: 89: Hoare triple {5356#(< ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5328#(< ~counter~0 37)} is VALID [2022-04-14 16:17:17,816 INFO L290 TraceCheckUtils]: 88: Hoare triple {5356#(< ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5356#(< ~counter~0 36)} is VALID [2022-04-14 16:17:17,816 INFO L290 TraceCheckUtils]: 87: Hoare triple {5356#(< ~counter~0 36)} assume !!(0 != ~r~0); {5356#(< ~counter~0 36)} is VALID [2022-04-14 16:17:17,817 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {4259#true} {5356#(< ~counter~0 36)} #63#return; {5356#(< ~counter~0 36)} is VALID [2022-04-14 16:17:17,817 INFO L290 TraceCheckUtils]: 85: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,817 INFO L290 TraceCheckUtils]: 84: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,817 INFO L290 TraceCheckUtils]: 83: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,817 INFO L272 TraceCheckUtils]: 82: Hoare triple {5356#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,817 INFO L290 TraceCheckUtils]: 81: Hoare triple {5356#(< ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {5356#(< ~counter~0 36)} is VALID [2022-04-14 16:17:17,818 INFO L290 TraceCheckUtils]: 80: Hoare triple {5384#(< ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5356#(< ~counter~0 36)} is VALID [2022-04-14 16:17:17,818 INFO L290 TraceCheckUtils]: 79: Hoare triple {5384#(< ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5384#(< ~counter~0 35)} is VALID [2022-04-14 16:17:17,818 INFO L290 TraceCheckUtils]: 78: Hoare triple {5384#(< ~counter~0 35)} assume !!(0 != ~r~0); {5384#(< ~counter~0 35)} is VALID [2022-04-14 16:17:17,818 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {4259#true} {5384#(< ~counter~0 35)} #63#return; {5384#(< ~counter~0 35)} is VALID [2022-04-14 16:17:17,818 INFO L290 TraceCheckUtils]: 76: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,819 INFO L272 TraceCheckUtils]: 73: Hoare triple {5384#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {5384#(< ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {5384#(< ~counter~0 35)} is VALID [2022-04-14 16:17:17,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {5412#(< ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5384#(< ~counter~0 35)} is VALID [2022-04-14 16:17:17,819 INFO L290 TraceCheckUtils]: 70: Hoare triple {5412#(< ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5412#(< ~counter~0 34)} is VALID [2022-04-14 16:17:17,820 INFO L290 TraceCheckUtils]: 69: Hoare triple {5412#(< ~counter~0 34)} assume !!(0 != ~r~0); {5412#(< ~counter~0 34)} is VALID [2022-04-14 16:17:17,820 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4259#true} {5412#(< ~counter~0 34)} #63#return; {5412#(< ~counter~0 34)} is VALID [2022-04-14 16:17:17,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,820 INFO L272 TraceCheckUtils]: 64: Hoare triple {5412#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,820 INFO L290 TraceCheckUtils]: 63: Hoare triple {5412#(< ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {5412#(< ~counter~0 34)} is VALID [2022-04-14 16:17:17,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {5440#(< ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5412#(< ~counter~0 34)} is VALID [2022-04-14 16:17:17,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {5440#(< ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5440#(< ~counter~0 33)} is VALID [2022-04-14 16:17:17,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {5440#(< ~counter~0 33)} assume !!(0 != ~r~0); {5440#(< ~counter~0 33)} is VALID [2022-04-14 16:17:17,822 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4259#true} {5440#(< ~counter~0 33)} #63#return; {5440#(< ~counter~0 33)} is VALID [2022-04-14 16:17:17,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,822 INFO L290 TraceCheckUtils]: 56: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,822 INFO L272 TraceCheckUtils]: 55: Hoare triple {5440#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,822 INFO L290 TraceCheckUtils]: 54: Hoare triple {5440#(< ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {5440#(< ~counter~0 33)} is VALID [2022-04-14 16:17:17,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {5468#(< ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5440#(< ~counter~0 33)} is VALID [2022-04-14 16:17:17,823 INFO L290 TraceCheckUtils]: 52: Hoare triple {5468#(< ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5468#(< ~counter~0 32)} is VALID [2022-04-14 16:17:17,823 INFO L290 TraceCheckUtils]: 51: Hoare triple {5468#(< ~counter~0 32)} assume !!(0 != ~r~0); {5468#(< ~counter~0 32)} is VALID [2022-04-14 16:17:17,823 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4259#true} {5468#(< ~counter~0 32)} #63#return; {5468#(< ~counter~0 32)} is VALID [2022-04-14 16:17:17,823 INFO L290 TraceCheckUtils]: 49: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,824 INFO L272 TraceCheckUtils]: 46: Hoare triple {5468#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {5468#(< ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {5468#(< ~counter~0 32)} is VALID [2022-04-14 16:17:17,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {5496#(< ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5468#(< ~counter~0 32)} is VALID [2022-04-14 16:17:17,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {5496#(< ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5496#(< ~counter~0 31)} is VALID [2022-04-14 16:17:17,825 INFO L290 TraceCheckUtils]: 42: Hoare triple {5496#(< ~counter~0 31)} assume !!(0 != ~r~0); {5496#(< ~counter~0 31)} is VALID [2022-04-14 16:17:17,825 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4259#true} {5496#(< ~counter~0 31)} #63#return; {5496#(< ~counter~0 31)} is VALID [2022-04-14 16:17:17,825 INFO L290 TraceCheckUtils]: 40: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,825 INFO L272 TraceCheckUtils]: 37: Hoare triple {5496#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {5496#(< ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {5496#(< ~counter~0 31)} is VALID [2022-04-14 16:17:17,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {5524#(< ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5496#(< ~counter~0 31)} is VALID [2022-04-14 16:17:17,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {5524#(< ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5524#(< ~counter~0 30)} is VALID [2022-04-14 16:17:17,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {5524#(< ~counter~0 30)} assume !!(0 != ~r~0); {5524#(< ~counter~0 30)} is VALID [2022-04-14 16:17:17,827 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4259#true} {5524#(< ~counter~0 30)} #63#return; {5524#(< ~counter~0 30)} is VALID [2022-04-14 16:17:17,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,827 INFO L272 TraceCheckUtils]: 28: Hoare triple {5524#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {5524#(< ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {5524#(< ~counter~0 30)} is VALID [2022-04-14 16:17:17,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {5552#(< ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5524#(< ~counter~0 30)} is VALID [2022-04-14 16:17:17,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {5552#(< ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5552#(< ~counter~0 29)} is VALID [2022-04-14 16:17:17,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {5552#(< ~counter~0 29)} assume !!(0 != ~r~0); {5552#(< ~counter~0 29)} is VALID [2022-04-14 16:17:17,828 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4259#true} {5552#(< ~counter~0 29)} #63#return; {5552#(< ~counter~0 29)} is VALID [2022-04-14 16:17:17,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,828 INFO L272 TraceCheckUtils]: 19: Hoare triple {5552#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {5552#(< ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {5552#(< ~counter~0 29)} is VALID [2022-04-14 16:17:17,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {5580#(< ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5552#(< ~counter~0 29)} is VALID [2022-04-14 16:17:17,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {5580#(< ~counter~0 28)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,830 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4259#true} {5580#(< ~counter~0 28)} #61#return; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {5580#(< ~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)); {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4259#true} {5580#(< ~counter~0 28)} #59#return; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {4259#true} assume true; {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {4259#true} assume !(0 == ~cond); {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {4259#true} ~cond := #in~cond; {4259#true} is VALID [2022-04-14 16:17:17,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {5580#(< ~counter~0 28)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4259#true} is VALID [2022-04-14 16:17:17,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {5580#(< ~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; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {5580#(< ~counter~0 28)} call #t~ret7 := main(); {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5580#(< ~counter~0 28)} {4259#true} #67#return; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {5580#(< ~counter~0 28)} assume true; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {4259#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; {5580#(< ~counter~0 28)} is VALID [2022-04-14 16:17:17,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {4259#true} call ULTIMATE.init(); {4259#true} is VALID [2022-04-14 16:17:17,833 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-14 16:17:17,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651521796] [2022-04-14 16:17:17,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:17,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179558889] [2022-04-14 16:17:17,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179558889] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:17,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-04-14 16:17:17,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529187916] [2022-04-14 16:17:17,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:17,835 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-14 16:17:17,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:17:17,835 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-14 16:17:18,088 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-14 16:17:18,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-14 16:17:18,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:17:18,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-14 16:17:18,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-04-14 16:17:18,090 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-14 16:17:20,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:20,321 INFO L93 Difference]: Finished difference Result 439 states and 509 transitions. [2022-04-14 16:17:20,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-04-14 16:17:20,321 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-14 16:17:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:17:20,322 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-14 16:17:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-14 16:17:20,338 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-14 16:17:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 508 transitions. [2022-04-14 16:17:20,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 508 transitions. [2022-04-14 16:17:20,718 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-14 16:17:20,727 INFO L225 Difference]: With dead ends: 439 [2022-04-14 16:17:20,727 INFO L226 Difference]: Without dead ends: 434 [2022-04-14 16:17:20,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-04-14 16:17:20,729 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 753 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-14 16:17:20,729 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [753 Valid, 454 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-14 16:17:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-14 16:17:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-04-14 16:17:20,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:17:20,864 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-14 16:17:20,869 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-14 16:17:20,870 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-14 16:17:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:20,883 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-14 16:17:20,883 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:20,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:20,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:20,884 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-14 16:17:20,885 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-14 16:17:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:17:20,895 INFO L93 Difference]: Finished difference Result 434 states and 481 transitions. [2022-04-14 16:17:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:20,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:17:20,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:17:20,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:17:20,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:17:20,897 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-14 16:17:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 481 transitions. [2022-04-14 16:17:20,913 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 481 transitions. Word has length 221 [2022-04-14 16:17:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:17:20,914 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 481 transitions. [2022-04-14 16:17:20,914 INFO L479 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-14 16:17:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 481 transitions. [2022-04-14 16:17:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2022-04-14 16:17:20,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:17:20,919 INFO L499 BasicCegarLoop]: 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-14 16:17:20,937 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-14 16:17:21,135 WARN L460 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-14 16:17:21,136 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:17:21,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:17:21,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1876588118, now seen corresponding path program 5 times [2022-04-14 16:17:21,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:17:21,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082181758] [2022-04-14 16:17:21,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:17:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:17:21,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:17:21,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1411604027] [2022-04-14 16:17:21,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-14 16:17:21,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:17:21,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:17:21,175 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-14 16:17:21,176 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-14 16:17:23,333 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-14 16:17:23,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:17:23,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 1013 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-14 16:17:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:17:23,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:17:25,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {7763#true} call ULTIMATE.init(); {7763#true} is VALID [2022-04-14 16:17:25,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {7763#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; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7771#(<= ~counter~0 0)} {7763#true} #67#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {7771#(<= ~counter~0 0)} call #t~ret7 := main(); {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {7771#(<= ~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; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {7771#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {7771#(<= ~counter~0 0)} ~cond := #in~cond; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {7771#(<= ~counter~0 0)} assume !(0 == ~cond); {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7771#(<= ~counter~0 0)} {7771#(<= ~counter~0 0)} #59#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,738 INFO L272 TraceCheckUtils]: 11: Hoare triple {7771#(<= ~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)); {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {7771#(<= ~counter~0 0)} ~cond := #in~cond; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {7771#(<= ~counter~0 0)} assume !(0 == ~cond); {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {7771#(<= ~counter~0 0)} assume true; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,739 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7771#(<= ~counter~0 0)} {7771#(<= ~counter~0 0)} #61#return; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {7771#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7771#(<= ~counter~0 0)} is VALID [2022-04-14 16:17:25,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {7771#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {7820#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,741 INFO L272 TraceCheckUtils]: 19: Hoare triple {7820#(<= ~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)); {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {7820#(<= ~counter~0 1)} ~cond := #in~cond; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {7820#(<= ~counter~0 1)} assume !(0 == ~cond); {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {7820#(<= ~counter~0 1)} assume true; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,742 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7820#(<= ~counter~0 1)} {7820#(<= ~counter~0 1)} #63#return; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {7820#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {7820#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7820#(<= ~counter~0 1)} is VALID [2022-04-14 16:17:25,743 INFO L290 TraceCheckUtils]: 26: Hoare triple {7820#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {7848#(<= ~counter~0 2)} assume !!(#t~post6 < 50);havoc #t~post6; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,744 INFO L272 TraceCheckUtils]: 28: Hoare triple {7848#(<= ~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)); {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,744 INFO L290 TraceCheckUtils]: 29: Hoare triple {7848#(<= ~counter~0 2)} ~cond := #in~cond; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {7848#(<= ~counter~0 2)} assume !(0 == ~cond); {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {7848#(<= ~counter~0 2)} assume true; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,745 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7848#(<= ~counter~0 2)} {7848#(<= ~counter~0 2)} #63#return; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {7848#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,746 INFO L290 TraceCheckUtils]: 34: Hoare triple {7848#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7848#(<= ~counter~0 2)} is VALID [2022-04-14 16:17:25,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {7848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {7876#(<= ~counter~0 3)} assume !!(#t~post6 < 50);havoc #t~post6; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,747 INFO L272 TraceCheckUtils]: 37: Hoare triple {7876#(<= ~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)); {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {7876#(<= ~counter~0 3)} ~cond := #in~cond; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {7876#(<= ~counter~0 3)} assume !(0 == ~cond); {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {7876#(<= ~counter~0 3)} assume true; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,748 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7876#(<= ~counter~0 3)} {7876#(<= ~counter~0 3)} #63#return; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {7876#(<= ~counter~0 3)} assume !!(0 != ~r~0); {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {7876#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:25,749 INFO L290 TraceCheckUtils]: 44: Hoare triple {7876#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,750 INFO L290 TraceCheckUtils]: 45: Hoare triple {7904#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,750 INFO L272 TraceCheckUtils]: 46: Hoare triple {7904#(<= ~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)); {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,750 INFO L290 TraceCheckUtils]: 47: Hoare triple {7904#(<= ~counter~0 4)} ~cond := #in~cond; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,751 INFO L290 TraceCheckUtils]: 48: Hoare triple {7904#(<= ~counter~0 4)} assume !(0 == ~cond); {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,751 INFO L290 TraceCheckUtils]: 49: Hoare triple {7904#(<= ~counter~0 4)} assume true; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,751 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7904#(<= ~counter~0 4)} {7904#(<= ~counter~0 4)} #63#return; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,752 INFO L290 TraceCheckUtils]: 51: Hoare triple {7904#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,752 INFO L290 TraceCheckUtils]: 52: Hoare triple {7904#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:25,752 INFO L290 TraceCheckUtils]: 53: Hoare triple {7904#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,753 INFO L290 TraceCheckUtils]: 54: Hoare triple {7932#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,753 INFO L272 TraceCheckUtils]: 55: Hoare triple {7932#(<= ~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)); {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,753 INFO L290 TraceCheckUtils]: 56: Hoare triple {7932#(<= ~counter~0 5)} ~cond := #in~cond; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {7932#(<= ~counter~0 5)} assume !(0 == ~cond); {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,754 INFO L290 TraceCheckUtils]: 58: Hoare triple {7932#(<= ~counter~0 5)} assume true; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,755 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7932#(<= ~counter~0 5)} {7932#(<= ~counter~0 5)} #63#return; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,755 INFO L290 TraceCheckUtils]: 60: Hoare triple {7932#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,755 INFO L290 TraceCheckUtils]: 61: Hoare triple {7932#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:25,755 INFO L290 TraceCheckUtils]: 62: Hoare triple {7932#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,756 INFO L290 TraceCheckUtils]: 63: Hoare triple {7960#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,756 INFO L272 TraceCheckUtils]: 64: Hoare triple {7960#(<= ~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)); {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,757 INFO L290 TraceCheckUtils]: 65: Hoare triple {7960#(<= ~counter~0 6)} ~cond := #in~cond; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,757 INFO L290 TraceCheckUtils]: 66: Hoare triple {7960#(<= ~counter~0 6)} assume !(0 == ~cond); {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,757 INFO L290 TraceCheckUtils]: 67: Hoare triple {7960#(<= ~counter~0 6)} assume true; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,758 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7960#(<= ~counter~0 6)} {7960#(<= ~counter~0 6)} #63#return; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,758 INFO L290 TraceCheckUtils]: 69: Hoare triple {7960#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {7960#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:25,759 INFO L290 TraceCheckUtils]: 71: Hoare triple {7960#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {7988#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,759 INFO L272 TraceCheckUtils]: 73: Hoare triple {7988#(<= ~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)); {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {7988#(<= ~counter~0 7)} ~cond := #in~cond; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {7988#(<= ~counter~0 7)} assume !(0 == ~cond); {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,760 INFO L290 TraceCheckUtils]: 76: Hoare triple {7988#(<= ~counter~0 7)} assume true; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,761 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7988#(<= ~counter~0 7)} {7988#(<= ~counter~0 7)} #63#return; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {7988#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,761 INFO L290 TraceCheckUtils]: 79: Hoare triple {7988#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:25,762 INFO L290 TraceCheckUtils]: 80: Hoare triple {7988#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,762 INFO L290 TraceCheckUtils]: 81: Hoare triple {8016#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,762 INFO L272 TraceCheckUtils]: 82: Hoare triple {8016#(<= ~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)); {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,763 INFO L290 TraceCheckUtils]: 83: Hoare triple {8016#(<= ~counter~0 8)} ~cond := #in~cond; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {8016#(<= ~counter~0 8)} assume !(0 == ~cond); {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {8016#(<= ~counter~0 8)} assume true; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,764 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8016#(<= ~counter~0 8)} {8016#(<= ~counter~0 8)} #63#return; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,764 INFO L290 TraceCheckUtils]: 87: Hoare triple {8016#(<= ~counter~0 8)} assume !!(0 != ~r~0); {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {8016#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:25,765 INFO L290 TraceCheckUtils]: 89: Hoare triple {8016#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,765 INFO L290 TraceCheckUtils]: 90: Hoare triple {8044#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,765 INFO L272 TraceCheckUtils]: 91: Hoare triple {8044#(<= ~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)); {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,766 INFO L290 TraceCheckUtils]: 92: Hoare triple {8044#(<= ~counter~0 9)} ~cond := #in~cond; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,766 INFO L290 TraceCheckUtils]: 93: Hoare triple {8044#(<= ~counter~0 9)} assume !(0 == ~cond); {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,766 INFO L290 TraceCheckUtils]: 94: Hoare triple {8044#(<= ~counter~0 9)} assume true; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,767 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8044#(<= ~counter~0 9)} {8044#(<= ~counter~0 9)} #63#return; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {8044#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {8044#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:25,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {8044#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,768 INFO L290 TraceCheckUtils]: 99: Hoare triple {8072#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,769 INFO L272 TraceCheckUtils]: 100: Hoare triple {8072#(<= ~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)); {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,769 INFO L290 TraceCheckUtils]: 101: Hoare triple {8072#(<= ~counter~0 10)} ~cond := #in~cond; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,769 INFO L290 TraceCheckUtils]: 102: Hoare triple {8072#(<= ~counter~0 10)} assume !(0 == ~cond); {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,769 INFO L290 TraceCheckUtils]: 103: Hoare triple {8072#(<= ~counter~0 10)} assume true; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,770 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {8072#(<= ~counter~0 10)} {8072#(<= ~counter~0 10)} #63#return; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,770 INFO L290 TraceCheckUtils]: 105: Hoare triple {8072#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,770 INFO L290 TraceCheckUtils]: 106: Hoare triple {8072#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:25,771 INFO L290 TraceCheckUtils]: 107: Hoare triple {8072#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,771 INFO L290 TraceCheckUtils]: 108: Hoare triple {8100#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,772 INFO L272 TraceCheckUtils]: 109: Hoare triple {8100#(<= ~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)); {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,772 INFO L290 TraceCheckUtils]: 110: Hoare triple {8100#(<= ~counter~0 11)} ~cond := #in~cond; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,772 INFO L290 TraceCheckUtils]: 111: Hoare triple {8100#(<= ~counter~0 11)} assume !(0 == ~cond); {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,773 INFO L290 TraceCheckUtils]: 112: Hoare triple {8100#(<= ~counter~0 11)} assume true; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,773 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {8100#(<= ~counter~0 11)} {8100#(<= ~counter~0 11)} #63#return; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,773 INFO L290 TraceCheckUtils]: 114: Hoare triple {8100#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {8100#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:25,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {8100#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {8128#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,775 INFO L272 TraceCheckUtils]: 118: Hoare triple {8128#(<= ~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)); {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,783 INFO L290 TraceCheckUtils]: 119: Hoare triple {8128#(<= ~counter~0 12)} ~cond := #in~cond; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,783 INFO L290 TraceCheckUtils]: 120: Hoare triple {8128#(<= ~counter~0 12)} assume !(0 == ~cond); {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,783 INFO L290 TraceCheckUtils]: 121: Hoare triple {8128#(<= ~counter~0 12)} assume true; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,784 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {8128#(<= ~counter~0 12)} {8128#(<= ~counter~0 12)} #63#return; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,784 INFO L290 TraceCheckUtils]: 123: Hoare triple {8128#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,784 INFO L290 TraceCheckUtils]: 124: Hoare triple {8128#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:25,785 INFO L290 TraceCheckUtils]: 125: Hoare triple {8128#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,785 INFO L290 TraceCheckUtils]: 126: Hoare triple {8156#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,786 INFO L272 TraceCheckUtils]: 127: Hoare triple {8156#(<= ~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)); {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,786 INFO L290 TraceCheckUtils]: 128: Hoare triple {8156#(<= ~counter~0 13)} ~cond := #in~cond; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,786 INFO L290 TraceCheckUtils]: 129: Hoare triple {8156#(<= ~counter~0 13)} assume !(0 == ~cond); {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,787 INFO L290 TraceCheckUtils]: 130: Hoare triple {8156#(<= ~counter~0 13)} assume true; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,787 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {8156#(<= ~counter~0 13)} {8156#(<= ~counter~0 13)} #63#return; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,787 INFO L290 TraceCheckUtils]: 132: Hoare triple {8156#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,788 INFO L290 TraceCheckUtils]: 133: Hoare triple {8156#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:25,788 INFO L290 TraceCheckUtils]: 134: Hoare triple {8156#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,788 INFO L290 TraceCheckUtils]: 135: Hoare triple {8184#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,789 INFO L272 TraceCheckUtils]: 136: Hoare triple {8184#(<= ~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)); {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,789 INFO L290 TraceCheckUtils]: 137: Hoare triple {8184#(<= ~counter~0 14)} ~cond := #in~cond; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,789 INFO L290 TraceCheckUtils]: 138: Hoare triple {8184#(<= ~counter~0 14)} assume !(0 == ~cond); {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,790 INFO L290 TraceCheckUtils]: 139: Hoare triple {8184#(<= ~counter~0 14)} assume true; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,790 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {8184#(<= ~counter~0 14)} {8184#(<= ~counter~0 14)} #63#return; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,790 INFO L290 TraceCheckUtils]: 141: Hoare triple {8184#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,791 INFO L290 TraceCheckUtils]: 142: Hoare triple {8184#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:25,791 INFO L290 TraceCheckUtils]: 143: Hoare triple {8184#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,791 INFO L290 TraceCheckUtils]: 144: Hoare triple {8212#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,792 INFO L272 TraceCheckUtils]: 145: Hoare triple {8212#(<= ~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)); {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,792 INFO L290 TraceCheckUtils]: 146: Hoare triple {8212#(<= ~counter~0 15)} ~cond := #in~cond; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,792 INFO L290 TraceCheckUtils]: 147: Hoare triple {8212#(<= ~counter~0 15)} assume !(0 == ~cond); {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,793 INFO L290 TraceCheckUtils]: 148: Hoare triple {8212#(<= ~counter~0 15)} assume true; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,793 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {8212#(<= ~counter~0 15)} {8212#(<= ~counter~0 15)} #63#return; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,794 INFO L290 TraceCheckUtils]: 150: Hoare triple {8212#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,794 INFO L290 TraceCheckUtils]: 151: Hoare triple {8212#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:25,794 INFO L290 TraceCheckUtils]: 152: Hoare triple {8212#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,794 INFO L290 TraceCheckUtils]: 153: Hoare triple {8240#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,795 INFO L272 TraceCheckUtils]: 154: Hoare triple {8240#(<= ~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)); {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,795 INFO L290 TraceCheckUtils]: 155: Hoare triple {8240#(<= ~counter~0 16)} ~cond := #in~cond; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,796 INFO L290 TraceCheckUtils]: 156: Hoare triple {8240#(<= ~counter~0 16)} assume !(0 == ~cond); {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,796 INFO L290 TraceCheckUtils]: 157: Hoare triple {8240#(<= ~counter~0 16)} assume true; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,796 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {8240#(<= ~counter~0 16)} {8240#(<= ~counter~0 16)} #63#return; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,797 INFO L290 TraceCheckUtils]: 159: Hoare triple {8240#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,797 INFO L290 TraceCheckUtils]: 160: Hoare triple {8240#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:25,797 INFO L290 TraceCheckUtils]: 161: Hoare triple {8240#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,798 INFO L290 TraceCheckUtils]: 162: Hoare triple {8268#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,798 INFO L272 TraceCheckUtils]: 163: Hoare triple {8268#(<= ~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)); {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,798 INFO L290 TraceCheckUtils]: 164: Hoare triple {8268#(<= ~counter~0 17)} ~cond := #in~cond; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,799 INFO L290 TraceCheckUtils]: 165: Hoare triple {8268#(<= ~counter~0 17)} assume !(0 == ~cond); {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,799 INFO L290 TraceCheckUtils]: 166: Hoare triple {8268#(<= ~counter~0 17)} assume true; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,800 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {8268#(<= ~counter~0 17)} {8268#(<= ~counter~0 17)} #63#return; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,800 INFO L290 TraceCheckUtils]: 168: Hoare triple {8268#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,800 INFO L290 TraceCheckUtils]: 169: Hoare triple {8268#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:25,801 INFO L290 TraceCheckUtils]: 170: Hoare triple {8268#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,801 INFO L290 TraceCheckUtils]: 171: Hoare triple {8296#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,802 INFO L272 TraceCheckUtils]: 172: Hoare triple {8296#(<= ~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)); {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,802 INFO L290 TraceCheckUtils]: 173: Hoare triple {8296#(<= ~counter~0 18)} ~cond := #in~cond; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,802 INFO L290 TraceCheckUtils]: 174: Hoare triple {8296#(<= ~counter~0 18)} assume !(0 == ~cond); {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,803 INFO L290 TraceCheckUtils]: 175: Hoare triple {8296#(<= ~counter~0 18)} assume true; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,803 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {8296#(<= ~counter~0 18)} {8296#(<= ~counter~0 18)} #63#return; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,804 INFO L290 TraceCheckUtils]: 177: Hoare triple {8296#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,804 INFO L290 TraceCheckUtils]: 178: Hoare triple {8296#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:25,804 INFO L290 TraceCheckUtils]: 179: Hoare triple {8296#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,805 INFO L290 TraceCheckUtils]: 180: Hoare triple {8324#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,805 INFO L272 TraceCheckUtils]: 181: Hoare triple {8324#(<= ~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)); {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,806 INFO L290 TraceCheckUtils]: 182: Hoare triple {8324#(<= ~counter~0 19)} ~cond := #in~cond; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,806 INFO L290 TraceCheckUtils]: 183: Hoare triple {8324#(<= ~counter~0 19)} assume !(0 == ~cond); {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,806 INFO L290 TraceCheckUtils]: 184: Hoare triple {8324#(<= ~counter~0 19)} assume true; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,807 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {8324#(<= ~counter~0 19)} {8324#(<= ~counter~0 19)} #63#return; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,807 INFO L290 TraceCheckUtils]: 186: Hoare triple {8324#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,808 INFO L290 TraceCheckUtils]: 187: Hoare triple {8324#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:25,808 INFO L290 TraceCheckUtils]: 188: Hoare triple {8324#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,808 INFO L290 TraceCheckUtils]: 189: Hoare triple {8352#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,809 INFO L272 TraceCheckUtils]: 190: Hoare triple {8352#(<= ~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)); {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,809 INFO L290 TraceCheckUtils]: 191: Hoare triple {8352#(<= ~counter~0 20)} ~cond := #in~cond; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,810 INFO L290 TraceCheckUtils]: 192: Hoare triple {8352#(<= ~counter~0 20)} assume !(0 == ~cond); {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,810 INFO L290 TraceCheckUtils]: 193: Hoare triple {8352#(<= ~counter~0 20)} assume true; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,810 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {8352#(<= ~counter~0 20)} {8352#(<= ~counter~0 20)} #63#return; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,811 INFO L290 TraceCheckUtils]: 195: Hoare triple {8352#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,811 INFO L290 TraceCheckUtils]: 196: Hoare triple {8352#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:25,812 INFO L290 TraceCheckUtils]: 197: Hoare triple {8352#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,812 INFO L290 TraceCheckUtils]: 198: Hoare triple {8380#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,812 INFO L272 TraceCheckUtils]: 199: Hoare triple {8380#(<= ~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)); {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,813 INFO L290 TraceCheckUtils]: 200: Hoare triple {8380#(<= ~counter~0 21)} ~cond := #in~cond; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,813 INFO L290 TraceCheckUtils]: 201: Hoare triple {8380#(<= ~counter~0 21)} assume !(0 == ~cond); {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,813 INFO L290 TraceCheckUtils]: 202: Hoare triple {8380#(<= ~counter~0 21)} assume true; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,814 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {8380#(<= ~counter~0 21)} {8380#(<= ~counter~0 21)} #63#return; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,814 INFO L290 TraceCheckUtils]: 204: Hoare triple {8380#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,815 INFO L290 TraceCheckUtils]: 205: Hoare triple {8380#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:25,815 INFO L290 TraceCheckUtils]: 206: Hoare triple {8380#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,815 INFO L290 TraceCheckUtils]: 207: Hoare triple {8408#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,816 INFO L272 TraceCheckUtils]: 208: Hoare triple {8408#(<= ~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)); {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,816 INFO L290 TraceCheckUtils]: 209: Hoare triple {8408#(<= ~counter~0 22)} ~cond := #in~cond; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,817 INFO L290 TraceCheckUtils]: 210: Hoare triple {8408#(<= ~counter~0 22)} assume !(0 == ~cond); {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,817 INFO L290 TraceCheckUtils]: 211: Hoare triple {8408#(<= ~counter~0 22)} assume true; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,818 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {8408#(<= ~counter~0 22)} {8408#(<= ~counter~0 22)} #63#return; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,818 INFO L290 TraceCheckUtils]: 213: Hoare triple {8408#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,818 INFO L290 TraceCheckUtils]: 214: Hoare triple {8408#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:25,819 INFO L290 TraceCheckUtils]: 215: Hoare triple {8408#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,819 INFO L290 TraceCheckUtils]: 216: Hoare triple {8436#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,819 INFO L272 TraceCheckUtils]: 217: Hoare triple {8436#(<= ~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)); {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,820 INFO L290 TraceCheckUtils]: 218: Hoare triple {8436#(<= ~counter~0 23)} ~cond := #in~cond; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,820 INFO L290 TraceCheckUtils]: 219: Hoare triple {8436#(<= ~counter~0 23)} assume !(0 == ~cond); {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,820 INFO L290 TraceCheckUtils]: 220: Hoare triple {8436#(<= ~counter~0 23)} assume true; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,821 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {8436#(<= ~counter~0 23)} {8436#(<= ~counter~0 23)} #63#return; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,821 INFO L290 TraceCheckUtils]: 222: Hoare triple {8436#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,821 INFO L290 TraceCheckUtils]: 223: Hoare triple {8436#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:25,822 INFO L290 TraceCheckUtils]: 224: Hoare triple {8436#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,822 INFO L290 TraceCheckUtils]: 225: Hoare triple {8464#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,823 INFO L272 TraceCheckUtils]: 226: Hoare triple {8464#(<= ~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)); {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,823 INFO L290 TraceCheckUtils]: 227: Hoare triple {8464#(<= ~counter~0 24)} ~cond := #in~cond; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,823 INFO L290 TraceCheckUtils]: 228: Hoare triple {8464#(<= ~counter~0 24)} assume !(0 == ~cond); {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,824 INFO L290 TraceCheckUtils]: 229: Hoare triple {8464#(<= ~counter~0 24)} assume true; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,824 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {8464#(<= ~counter~0 24)} {8464#(<= ~counter~0 24)} #63#return; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,824 INFO L290 TraceCheckUtils]: 231: Hoare triple {8464#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,825 INFO L290 TraceCheckUtils]: 232: Hoare triple {8464#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:25,825 INFO L290 TraceCheckUtils]: 233: Hoare triple {8464#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,825 INFO L290 TraceCheckUtils]: 234: Hoare triple {8492#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,826 INFO L272 TraceCheckUtils]: 235: Hoare triple {8492#(<= ~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)); {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,826 INFO L290 TraceCheckUtils]: 236: Hoare triple {8492#(<= ~counter~0 25)} ~cond := #in~cond; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,826 INFO L290 TraceCheckUtils]: 237: Hoare triple {8492#(<= ~counter~0 25)} assume !(0 == ~cond); {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,827 INFO L290 TraceCheckUtils]: 238: Hoare triple {8492#(<= ~counter~0 25)} assume true; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,827 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {8492#(<= ~counter~0 25)} {8492#(<= ~counter~0 25)} #63#return; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,828 INFO L290 TraceCheckUtils]: 240: Hoare triple {8492#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,828 INFO L290 TraceCheckUtils]: 241: Hoare triple {8492#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:25,828 INFO L290 TraceCheckUtils]: 242: Hoare triple {8492#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,829 INFO L290 TraceCheckUtils]: 243: Hoare triple {8520#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,829 INFO L272 TraceCheckUtils]: 244: Hoare triple {8520#(<= ~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)); {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,829 INFO L290 TraceCheckUtils]: 245: Hoare triple {8520#(<= ~counter~0 26)} ~cond := #in~cond; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,830 INFO L290 TraceCheckUtils]: 246: Hoare triple {8520#(<= ~counter~0 26)} assume !(0 == ~cond); {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,830 INFO L290 TraceCheckUtils]: 247: Hoare triple {8520#(<= ~counter~0 26)} assume true; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,831 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {8520#(<= ~counter~0 26)} {8520#(<= ~counter~0 26)} #63#return; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,831 INFO L290 TraceCheckUtils]: 249: Hoare triple {8520#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,831 INFO L290 TraceCheckUtils]: 250: Hoare triple {8520#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:25,831 INFO L290 TraceCheckUtils]: 251: Hoare triple {8520#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,832 INFO L290 TraceCheckUtils]: 252: Hoare triple {8548#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,832 INFO L272 TraceCheckUtils]: 253: Hoare triple {8548#(<= ~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)); {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,833 INFO L290 TraceCheckUtils]: 254: Hoare triple {8548#(<= ~counter~0 27)} ~cond := #in~cond; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,833 INFO L290 TraceCheckUtils]: 255: Hoare triple {8548#(<= ~counter~0 27)} assume !(0 == ~cond); {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,833 INFO L290 TraceCheckUtils]: 256: Hoare triple {8548#(<= ~counter~0 27)} assume true; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,834 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {8548#(<= ~counter~0 27)} {8548#(<= ~counter~0 27)} #63#return; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,834 INFO L290 TraceCheckUtils]: 258: Hoare triple {8548#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,834 INFO L290 TraceCheckUtils]: 259: Hoare triple {8548#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:25,835 INFO L290 TraceCheckUtils]: 260: Hoare triple {8548#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,835 INFO L290 TraceCheckUtils]: 261: Hoare triple {8576#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,836 INFO L272 TraceCheckUtils]: 262: Hoare triple {8576#(<= ~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)); {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,836 INFO L290 TraceCheckUtils]: 263: Hoare triple {8576#(<= ~counter~0 28)} ~cond := #in~cond; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,836 INFO L290 TraceCheckUtils]: 264: Hoare triple {8576#(<= ~counter~0 28)} assume !(0 == ~cond); {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,836 INFO L290 TraceCheckUtils]: 265: Hoare triple {8576#(<= ~counter~0 28)} assume true; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,837 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {8576#(<= ~counter~0 28)} {8576#(<= ~counter~0 28)} #63#return; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,837 INFO L290 TraceCheckUtils]: 267: Hoare triple {8576#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,838 INFO L290 TraceCheckUtils]: 268: Hoare triple {8576#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:25,838 INFO L290 TraceCheckUtils]: 269: Hoare triple {8576#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,838 INFO L290 TraceCheckUtils]: 270: Hoare triple {8604#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,839 INFO L272 TraceCheckUtils]: 271: Hoare triple {8604#(<= ~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)); {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,839 INFO L290 TraceCheckUtils]: 272: Hoare triple {8604#(<= ~counter~0 29)} ~cond := #in~cond; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,839 INFO L290 TraceCheckUtils]: 273: Hoare triple {8604#(<= ~counter~0 29)} assume !(0 == ~cond); {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,840 INFO L290 TraceCheckUtils]: 274: Hoare triple {8604#(<= ~counter~0 29)} assume true; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,840 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {8604#(<= ~counter~0 29)} {8604#(<= ~counter~0 29)} #63#return; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,840 INFO L290 TraceCheckUtils]: 276: Hoare triple {8604#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,841 INFO L290 TraceCheckUtils]: 277: Hoare triple {8604#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:25,841 INFO L290 TraceCheckUtils]: 278: Hoare triple {8604#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,841 INFO L290 TraceCheckUtils]: 279: Hoare triple {8632#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,842 INFO L272 TraceCheckUtils]: 280: Hoare triple {8632#(<= ~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)); {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,842 INFO L290 TraceCheckUtils]: 281: Hoare triple {8632#(<= ~counter~0 30)} ~cond := #in~cond; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,843 INFO L290 TraceCheckUtils]: 282: Hoare triple {8632#(<= ~counter~0 30)} assume !(0 == ~cond); {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,843 INFO L290 TraceCheckUtils]: 283: Hoare triple {8632#(<= ~counter~0 30)} assume true; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,843 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {8632#(<= ~counter~0 30)} {8632#(<= ~counter~0 30)} #63#return; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,844 INFO L290 TraceCheckUtils]: 285: Hoare triple {8632#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,844 INFO L290 TraceCheckUtils]: 286: Hoare triple {8632#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:25,844 INFO L290 TraceCheckUtils]: 287: Hoare triple {8632#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,845 INFO L290 TraceCheckUtils]: 288: Hoare triple {8660#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,845 INFO L272 TraceCheckUtils]: 289: Hoare triple {8660#(<= ~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)); {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,845 INFO L290 TraceCheckUtils]: 290: Hoare triple {8660#(<= ~counter~0 31)} ~cond := #in~cond; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,846 INFO L290 TraceCheckUtils]: 291: Hoare triple {8660#(<= ~counter~0 31)} assume !(0 == ~cond); {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,846 INFO L290 TraceCheckUtils]: 292: Hoare triple {8660#(<= ~counter~0 31)} assume true; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,847 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {8660#(<= ~counter~0 31)} {8660#(<= ~counter~0 31)} #63#return; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,847 INFO L290 TraceCheckUtils]: 294: Hoare triple {8660#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,847 INFO L290 TraceCheckUtils]: 295: Hoare triple {8660#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:25,848 INFO L290 TraceCheckUtils]: 296: Hoare triple {8660#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,848 INFO L290 TraceCheckUtils]: 297: Hoare triple {8688#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,848 INFO L272 TraceCheckUtils]: 298: Hoare triple {8688#(<= ~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)); {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,849 INFO L290 TraceCheckUtils]: 299: Hoare triple {8688#(<= ~counter~0 32)} ~cond := #in~cond; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,849 INFO L290 TraceCheckUtils]: 300: Hoare triple {8688#(<= ~counter~0 32)} assume !(0 == ~cond); {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,849 INFO L290 TraceCheckUtils]: 301: Hoare triple {8688#(<= ~counter~0 32)} assume true; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,850 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {8688#(<= ~counter~0 32)} {8688#(<= ~counter~0 32)} #63#return; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,850 INFO L290 TraceCheckUtils]: 303: Hoare triple {8688#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,850 INFO L290 TraceCheckUtils]: 304: Hoare triple {8688#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:25,851 INFO L290 TraceCheckUtils]: 305: Hoare triple {8688#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,851 INFO L290 TraceCheckUtils]: 306: Hoare triple {8716#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,852 INFO L272 TraceCheckUtils]: 307: Hoare triple {8716#(<= ~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)); {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,852 INFO L290 TraceCheckUtils]: 308: Hoare triple {8716#(<= ~counter~0 33)} ~cond := #in~cond; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,852 INFO L290 TraceCheckUtils]: 309: Hoare triple {8716#(<= ~counter~0 33)} assume !(0 == ~cond); {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,852 INFO L290 TraceCheckUtils]: 310: Hoare triple {8716#(<= ~counter~0 33)} assume true; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,853 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {8716#(<= ~counter~0 33)} {8716#(<= ~counter~0 33)} #63#return; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,853 INFO L290 TraceCheckUtils]: 312: Hoare triple {8716#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,853 INFO L290 TraceCheckUtils]: 313: Hoare triple {8716#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:25,854 INFO L290 TraceCheckUtils]: 314: Hoare triple {8716#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,854 INFO L290 TraceCheckUtils]: 315: Hoare triple {8744#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,854 INFO L272 TraceCheckUtils]: 316: Hoare triple {8744#(<= ~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)); {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,855 INFO L290 TraceCheckUtils]: 317: Hoare triple {8744#(<= ~counter~0 34)} ~cond := #in~cond; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,855 INFO L290 TraceCheckUtils]: 318: Hoare triple {8744#(<= ~counter~0 34)} assume !(0 == ~cond); {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,855 INFO L290 TraceCheckUtils]: 319: Hoare triple {8744#(<= ~counter~0 34)} assume true; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,856 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {8744#(<= ~counter~0 34)} {8744#(<= ~counter~0 34)} #63#return; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,856 INFO L290 TraceCheckUtils]: 321: Hoare triple {8744#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,856 INFO L290 TraceCheckUtils]: 322: Hoare triple {8744#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:25,856 INFO L290 TraceCheckUtils]: 323: Hoare triple {8744#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,857 INFO L290 TraceCheckUtils]: 324: Hoare triple {8772#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,857 INFO L272 TraceCheckUtils]: 325: Hoare triple {8772#(<= ~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)); {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,857 INFO L290 TraceCheckUtils]: 326: Hoare triple {8772#(<= ~counter~0 35)} ~cond := #in~cond; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,858 INFO L290 TraceCheckUtils]: 327: Hoare triple {8772#(<= ~counter~0 35)} assume !(0 == ~cond); {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,858 INFO L290 TraceCheckUtils]: 328: Hoare triple {8772#(<= ~counter~0 35)} assume true; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,858 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {8772#(<= ~counter~0 35)} {8772#(<= ~counter~0 35)} #63#return; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,859 INFO L290 TraceCheckUtils]: 330: Hoare triple {8772#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,859 INFO L290 TraceCheckUtils]: 331: Hoare triple {8772#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:25,859 INFO L290 TraceCheckUtils]: 332: Hoare triple {8772#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,860 INFO L290 TraceCheckUtils]: 333: Hoare triple {8800#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,860 INFO L272 TraceCheckUtils]: 334: Hoare triple {8800#(<= ~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)); {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,860 INFO L290 TraceCheckUtils]: 335: Hoare triple {8800#(<= ~counter~0 36)} ~cond := #in~cond; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,860 INFO L290 TraceCheckUtils]: 336: Hoare triple {8800#(<= ~counter~0 36)} assume !(0 == ~cond); {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,861 INFO L290 TraceCheckUtils]: 337: Hoare triple {8800#(<= ~counter~0 36)} assume true; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,861 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {8800#(<= ~counter~0 36)} {8800#(<= ~counter~0 36)} #63#return; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,861 INFO L290 TraceCheckUtils]: 339: Hoare triple {8800#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,862 INFO L290 TraceCheckUtils]: 340: Hoare triple {8800#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:25,862 INFO L290 TraceCheckUtils]: 341: Hoare triple {8800#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,862 INFO L290 TraceCheckUtils]: 342: Hoare triple {8828#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,863 INFO L272 TraceCheckUtils]: 343: Hoare triple {8828#(<= ~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)); {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,863 INFO L290 TraceCheckUtils]: 344: Hoare triple {8828#(<= ~counter~0 37)} ~cond := #in~cond; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,863 INFO L290 TraceCheckUtils]: 345: Hoare triple {8828#(<= ~counter~0 37)} assume !(0 == ~cond); {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,864 INFO L290 TraceCheckUtils]: 346: Hoare triple {8828#(<= ~counter~0 37)} assume true; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,864 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {8828#(<= ~counter~0 37)} {8828#(<= ~counter~0 37)} #63#return; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,864 INFO L290 TraceCheckUtils]: 348: Hoare triple {8828#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,865 INFO L290 TraceCheckUtils]: 349: Hoare triple {8828#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:25,865 INFO L290 TraceCheckUtils]: 350: Hoare triple {8828#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,865 INFO L290 TraceCheckUtils]: 351: Hoare triple {8856#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,866 INFO L272 TraceCheckUtils]: 352: Hoare triple {8856#(<= ~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)); {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,866 INFO L290 TraceCheckUtils]: 353: Hoare triple {8856#(<= ~counter~0 38)} ~cond := #in~cond; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,866 INFO L290 TraceCheckUtils]: 354: Hoare triple {8856#(<= ~counter~0 38)} assume !(0 == ~cond); {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,866 INFO L290 TraceCheckUtils]: 355: Hoare triple {8856#(<= ~counter~0 38)} assume true; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,867 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {8856#(<= ~counter~0 38)} {8856#(<= ~counter~0 38)} #63#return; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,867 INFO L290 TraceCheckUtils]: 357: Hoare triple {8856#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,867 INFO L290 TraceCheckUtils]: 358: Hoare triple {8856#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:25,868 INFO L290 TraceCheckUtils]: 359: Hoare triple {8856#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,868 INFO L290 TraceCheckUtils]: 360: Hoare triple {8884#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,869 INFO L272 TraceCheckUtils]: 361: Hoare triple {8884#(<= ~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)); {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,869 INFO L290 TraceCheckUtils]: 362: Hoare triple {8884#(<= ~counter~0 39)} ~cond := #in~cond; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,869 INFO L290 TraceCheckUtils]: 363: Hoare triple {8884#(<= ~counter~0 39)} assume !(0 == ~cond); {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,869 INFO L290 TraceCheckUtils]: 364: Hoare triple {8884#(<= ~counter~0 39)} assume true; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,870 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {8884#(<= ~counter~0 39)} {8884#(<= ~counter~0 39)} #63#return; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,870 INFO L290 TraceCheckUtils]: 366: Hoare triple {8884#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,870 INFO L290 TraceCheckUtils]: 367: Hoare triple {8884#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:25,871 INFO L290 TraceCheckUtils]: 368: Hoare triple {8884#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,871 INFO L290 TraceCheckUtils]: 369: Hoare triple {8912#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,871 INFO L272 TraceCheckUtils]: 370: Hoare triple {8912#(<= ~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)); {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,872 INFO L290 TraceCheckUtils]: 371: Hoare triple {8912#(<= ~counter~0 40)} ~cond := #in~cond; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,872 INFO L290 TraceCheckUtils]: 372: Hoare triple {8912#(<= ~counter~0 40)} assume !(0 == ~cond); {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,872 INFO L290 TraceCheckUtils]: 373: Hoare triple {8912#(<= ~counter~0 40)} assume true; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,873 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {8912#(<= ~counter~0 40)} {8912#(<= ~counter~0 40)} #63#return; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,873 INFO L290 TraceCheckUtils]: 375: Hoare triple {8912#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,873 INFO L290 TraceCheckUtils]: 376: Hoare triple {8912#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:25,873 INFO L290 TraceCheckUtils]: 377: Hoare triple {8912#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,874 INFO L290 TraceCheckUtils]: 378: Hoare triple {8940#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,874 INFO L272 TraceCheckUtils]: 379: Hoare triple {8940#(<= ~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)); {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,874 INFO L290 TraceCheckUtils]: 380: Hoare triple {8940#(<= ~counter~0 41)} ~cond := #in~cond; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,875 INFO L290 TraceCheckUtils]: 381: Hoare triple {8940#(<= ~counter~0 41)} assume !(0 == ~cond); {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,875 INFO L290 TraceCheckUtils]: 382: Hoare triple {8940#(<= ~counter~0 41)} assume true; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,875 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {8940#(<= ~counter~0 41)} {8940#(<= ~counter~0 41)} #63#return; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,876 INFO L290 TraceCheckUtils]: 384: Hoare triple {8940#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,876 INFO L290 TraceCheckUtils]: 385: Hoare triple {8940#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:25,876 INFO L290 TraceCheckUtils]: 386: Hoare triple {8940#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,876 INFO L290 TraceCheckUtils]: 387: Hoare triple {8968#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,877 INFO L272 TraceCheckUtils]: 388: Hoare triple {8968#(<= ~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)); {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,877 INFO L290 TraceCheckUtils]: 389: Hoare triple {8968#(<= ~counter~0 42)} ~cond := #in~cond; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,877 INFO L290 TraceCheckUtils]: 390: Hoare triple {8968#(<= ~counter~0 42)} assume !(0 == ~cond); {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,878 INFO L290 TraceCheckUtils]: 391: Hoare triple {8968#(<= ~counter~0 42)} assume true; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,878 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {8968#(<= ~counter~0 42)} {8968#(<= ~counter~0 42)} #63#return; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,878 INFO L290 TraceCheckUtils]: 393: Hoare triple {8968#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,879 INFO L290 TraceCheckUtils]: 394: Hoare triple {8968#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:25,879 INFO L290 TraceCheckUtils]: 395: Hoare triple {8968#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,879 INFO L290 TraceCheckUtils]: 396: Hoare triple {8996#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,880 INFO L272 TraceCheckUtils]: 397: Hoare triple {8996#(<= ~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)); {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,880 INFO L290 TraceCheckUtils]: 398: Hoare triple {8996#(<= ~counter~0 43)} ~cond := #in~cond; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,880 INFO L290 TraceCheckUtils]: 399: Hoare triple {8996#(<= ~counter~0 43)} assume !(0 == ~cond); {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,881 INFO L290 TraceCheckUtils]: 400: Hoare triple {8996#(<= ~counter~0 43)} assume true; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,881 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {8996#(<= ~counter~0 43)} {8996#(<= ~counter~0 43)} #63#return; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,881 INFO L290 TraceCheckUtils]: 402: Hoare triple {8996#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,881 INFO L290 TraceCheckUtils]: 403: Hoare triple {8996#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:25,882 INFO L290 TraceCheckUtils]: 404: Hoare triple {8996#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,882 INFO L290 TraceCheckUtils]: 405: Hoare triple {9024#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,883 INFO L272 TraceCheckUtils]: 406: Hoare triple {9024#(<= ~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)); {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,883 INFO L290 TraceCheckUtils]: 407: Hoare triple {9024#(<= ~counter~0 44)} ~cond := #in~cond; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,883 INFO L290 TraceCheckUtils]: 408: Hoare triple {9024#(<= ~counter~0 44)} assume !(0 == ~cond); {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,883 INFO L290 TraceCheckUtils]: 409: Hoare triple {9024#(<= ~counter~0 44)} assume true; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,884 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {9024#(<= ~counter~0 44)} {9024#(<= ~counter~0 44)} #63#return; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,884 INFO L290 TraceCheckUtils]: 411: Hoare triple {9024#(<= ~counter~0 44)} assume !!(0 != ~r~0); {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,884 INFO L290 TraceCheckUtils]: 412: Hoare triple {9024#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:25,885 INFO L290 TraceCheckUtils]: 413: Hoare triple {9024#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,885 INFO L290 TraceCheckUtils]: 414: Hoare triple {9052#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,885 INFO L272 TraceCheckUtils]: 415: Hoare triple {9052#(<= ~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)); {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,886 INFO L290 TraceCheckUtils]: 416: Hoare triple {9052#(<= ~counter~0 45)} ~cond := #in~cond; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,886 INFO L290 TraceCheckUtils]: 417: Hoare triple {9052#(<= ~counter~0 45)} assume !(0 == ~cond); {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,886 INFO L290 TraceCheckUtils]: 418: Hoare triple {9052#(<= ~counter~0 45)} assume true; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,887 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {9052#(<= ~counter~0 45)} {9052#(<= ~counter~0 45)} #63#return; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,887 INFO L290 TraceCheckUtils]: 420: Hoare triple {9052#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,887 INFO L290 TraceCheckUtils]: 421: Hoare triple {9052#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:25,888 INFO L290 TraceCheckUtils]: 422: Hoare triple {9052#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,888 INFO L290 TraceCheckUtils]: 423: Hoare triple {9080#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,888 INFO L272 TraceCheckUtils]: 424: Hoare triple {9080#(<= ~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)); {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,888 INFO L290 TraceCheckUtils]: 425: Hoare triple {9080#(<= ~counter~0 46)} ~cond := #in~cond; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,889 INFO L290 TraceCheckUtils]: 426: Hoare triple {9080#(<= ~counter~0 46)} assume !(0 == ~cond); {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,889 INFO L290 TraceCheckUtils]: 427: Hoare triple {9080#(<= ~counter~0 46)} assume true; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,889 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {9080#(<= ~counter~0 46)} {9080#(<= ~counter~0 46)} #63#return; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,890 INFO L290 TraceCheckUtils]: 429: Hoare triple {9080#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,890 INFO L290 TraceCheckUtils]: 430: Hoare triple {9080#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:25,890 INFO L290 TraceCheckUtils]: 431: Hoare triple {9080#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9108#(<= |main_#t~post6| 46)} is VALID [2022-04-14 16:17:25,891 INFO L290 TraceCheckUtils]: 432: Hoare triple {9108#(<= |main_#t~post6| 46)} assume !(#t~post6 < 50);havoc #t~post6; {7764#false} is VALID [2022-04-14 16:17:25,891 INFO L272 TraceCheckUtils]: 433: Hoare triple {7764#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)); {7764#false} is VALID [2022-04-14 16:17:25,891 INFO L290 TraceCheckUtils]: 434: Hoare triple {7764#false} ~cond := #in~cond; {7764#false} is VALID [2022-04-14 16:17:25,891 INFO L290 TraceCheckUtils]: 435: Hoare triple {7764#false} assume 0 == ~cond; {7764#false} is VALID [2022-04-14 16:17:25,891 INFO L290 TraceCheckUtils]: 436: Hoare triple {7764#false} assume !false; {7764#false} is VALID [2022-04-14 16:17:25,894 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-14 16:17:25,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:17:27,818 INFO L290 TraceCheckUtils]: 436: Hoare triple {7764#false} assume !false; {7764#false} is VALID [2022-04-14 16:17:27,818 INFO L290 TraceCheckUtils]: 435: Hoare triple {7764#false} assume 0 == ~cond; {7764#false} is VALID [2022-04-14 16:17:27,818 INFO L290 TraceCheckUtils]: 434: Hoare triple {7764#false} ~cond := #in~cond; {7764#false} is VALID [2022-04-14 16:17:27,818 INFO L272 TraceCheckUtils]: 433: Hoare triple {7764#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)); {7764#false} is VALID [2022-04-14 16:17:27,818 INFO L290 TraceCheckUtils]: 432: Hoare triple {9136#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {7764#false} is VALID [2022-04-14 16:17:27,819 INFO L290 TraceCheckUtils]: 431: Hoare triple {9140#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9136#(< |main_#t~post6| 50)} is VALID [2022-04-14 16:17:27,819 INFO L290 TraceCheckUtils]: 430: Hoare triple {9140#(< ~counter~0 50)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9140#(< ~counter~0 50)} is VALID [2022-04-14 16:17:27,819 INFO L290 TraceCheckUtils]: 429: Hoare triple {9140#(< ~counter~0 50)} assume !!(0 != ~r~0); {9140#(< ~counter~0 50)} is VALID [2022-04-14 16:17:27,819 INFO L284 TraceCheckUtils]: 428: Hoare quadruple {7763#true} {9140#(< ~counter~0 50)} #63#return; {9140#(< ~counter~0 50)} is VALID [2022-04-14 16:17:27,820 INFO L290 TraceCheckUtils]: 427: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,820 INFO L290 TraceCheckUtils]: 426: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,820 INFO L290 TraceCheckUtils]: 425: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,820 INFO L272 TraceCheckUtils]: 424: Hoare triple {9140#(< ~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)); {7763#true} is VALID [2022-04-14 16:17:27,820 INFO L290 TraceCheckUtils]: 423: Hoare triple {9140#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {9140#(< ~counter~0 50)} is VALID [2022-04-14 16:17:27,820 INFO L290 TraceCheckUtils]: 422: Hoare triple {9168#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9140#(< ~counter~0 50)} is VALID [2022-04-14 16:17:27,821 INFO L290 TraceCheckUtils]: 421: Hoare triple {9168#(< ~counter~0 49)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9168#(< ~counter~0 49)} is VALID [2022-04-14 16:17:27,821 INFO L290 TraceCheckUtils]: 420: Hoare triple {9168#(< ~counter~0 49)} assume !!(0 != ~r~0); {9168#(< ~counter~0 49)} is VALID [2022-04-14 16:17:27,821 INFO L284 TraceCheckUtils]: 419: Hoare quadruple {7763#true} {9168#(< ~counter~0 49)} #63#return; {9168#(< ~counter~0 49)} is VALID [2022-04-14 16:17:27,821 INFO L290 TraceCheckUtils]: 418: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,821 INFO L290 TraceCheckUtils]: 417: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,821 INFO L290 TraceCheckUtils]: 416: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,821 INFO L272 TraceCheckUtils]: 415: Hoare triple {9168#(< ~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)); {7763#true} is VALID [2022-04-14 16:17:27,822 INFO L290 TraceCheckUtils]: 414: Hoare triple {9168#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {9168#(< ~counter~0 49)} is VALID [2022-04-14 16:17:27,822 INFO L290 TraceCheckUtils]: 413: Hoare triple {9196#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9168#(< ~counter~0 49)} is VALID [2022-04-14 16:17:27,822 INFO L290 TraceCheckUtils]: 412: Hoare triple {9196#(< ~counter~0 48)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9196#(< ~counter~0 48)} is VALID [2022-04-14 16:17:27,822 INFO L290 TraceCheckUtils]: 411: Hoare triple {9196#(< ~counter~0 48)} assume !!(0 != ~r~0); {9196#(< ~counter~0 48)} is VALID [2022-04-14 16:17:27,823 INFO L284 TraceCheckUtils]: 410: Hoare quadruple {7763#true} {9196#(< ~counter~0 48)} #63#return; {9196#(< ~counter~0 48)} is VALID [2022-04-14 16:17:27,823 INFO L290 TraceCheckUtils]: 409: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,823 INFO L290 TraceCheckUtils]: 408: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,823 INFO L290 TraceCheckUtils]: 407: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,823 INFO L272 TraceCheckUtils]: 406: Hoare triple {9196#(< ~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)); {7763#true} is VALID [2022-04-14 16:17:27,823 INFO L290 TraceCheckUtils]: 405: Hoare triple {9196#(< ~counter~0 48)} assume !!(#t~post6 < 50);havoc #t~post6; {9196#(< ~counter~0 48)} is VALID [2022-04-14 16:17:27,824 INFO L290 TraceCheckUtils]: 404: Hoare triple {9080#(<= ~counter~0 46)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9196#(< ~counter~0 48)} is VALID [2022-04-14 16:17:27,824 INFO L290 TraceCheckUtils]: 403: Hoare triple {9080#(<= ~counter~0 46)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:27,824 INFO L290 TraceCheckUtils]: 402: Hoare triple {9080#(<= ~counter~0 46)} assume !!(0 != ~r~0); {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:27,825 INFO L284 TraceCheckUtils]: 401: Hoare quadruple {7763#true} {9080#(<= ~counter~0 46)} #63#return; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:27,825 INFO L290 TraceCheckUtils]: 400: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,825 INFO L290 TraceCheckUtils]: 399: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,825 INFO L290 TraceCheckUtils]: 398: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,825 INFO L272 TraceCheckUtils]: 397: Hoare triple {9080#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,825 INFO L290 TraceCheckUtils]: 396: Hoare triple {9080#(<= ~counter~0 46)} assume !!(#t~post6 < 50);havoc #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:27,825 INFO L290 TraceCheckUtils]: 395: Hoare triple {9052#(<= ~counter~0 45)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9080#(<= ~counter~0 46)} is VALID [2022-04-14 16:17:27,826 INFO L290 TraceCheckUtils]: 394: Hoare triple {9052#(<= ~counter~0 45)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:27,826 INFO L290 TraceCheckUtils]: 393: Hoare triple {9052#(<= ~counter~0 45)} assume !!(0 != ~r~0); {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:27,826 INFO L284 TraceCheckUtils]: 392: Hoare quadruple {7763#true} {9052#(<= ~counter~0 45)} #63#return; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:27,826 INFO L290 TraceCheckUtils]: 391: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,826 INFO L290 TraceCheckUtils]: 390: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,826 INFO L290 TraceCheckUtils]: 389: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,826 INFO L272 TraceCheckUtils]: 388: Hoare triple {9052#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,827 INFO L290 TraceCheckUtils]: 387: Hoare triple {9052#(<= ~counter~0 45)} assume !!(#t~post6 < 50);havoc #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:27,827 INFO L290 TraceCheckUtils]: 386: Hoare triple {9024#(<= ~counter~0 44)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9052#(<= ~counter~0 45)} is VALID [2022-04-14 16:17:27,827 INFO L290 TraceCheckUtils]: 385: Hoare triple {9024#(<= ~counter~0 44)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:27,827 INFO L290 TraceCheckUtils]: 384: Hoare triple {9024#(<= ~counter~0 44)} assume !!(0 != ~r~0); {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:27,828 INFO L284 TraceCheckUtils]: 383: Hoare quadruple {7763#true} {9024#(<= ~counter~0 44)} #63#return; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:27,828 INFO L290 TraceCheckUtils]: 382: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,828 INFO L290 TraceCheckUtils]: 381: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,828 INFO L290 TraceCheckUtils]: 380: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,828 INFO L272 TraceCheckUtils]: 379: Hoare triple {9024#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,828 INFO L290 TraceCheckUtils]: 378: Hoare triple {9024#(<= ~counter~0 44)} assume !!(#t~post6 < 50);havoc #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:27,829 INFO L290 TraceCheckUtils]: 377: Hoare triple {8996#(<= ~counter~0 43)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9024#(<= ~counter~0 44)} is VALID [2022-04-14 16:17:27,829 INFO L290 TraceCheckUtils]: 376: Hoare triple {8996#(<= ~counter~0 43)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:27,829 INFO L290 TraceCheckUtils]: 375: Hoare triple {8996#(<= ~counter~0 43)} assume !!(0 != ~r~0); {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:27,830 INFO L284 TraceCheckUtils]: 374: Hoare quadruple {7763#true} {8996#(<= ~counter~0 43)} #63#return; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:27,830 INFO L290 TraceCheckUtils]: 373: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,830 INFO L290 TraceCheckUtils]: 372: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,830 INFO L290 TraceCheckUtils]: 371: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,830 INFO L272 TraceCheckUtils]: 370: Hoare triple {8996#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,830 INFO L290 TraceCheckUtils]: 369: Hoare triple {8996#(<= ~counter~0 43)} assume !!(#t~post6 < 50);havoc #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:27,830 INFO L290 TraceCheckUtils]: 368: Hoare triple {8968#(<= ~counter~0 42)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8996#(<= ~counter~0 43)} is VALID [2022-04-14 16:17:27,831 INFO L290 TraceCheckUtils]: 367: Hoare triple {8968#(<= ~counter~0 42)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:27,831 INFO L290 TraceCheckUtils]: 366: Hoare triple {8968#(<= ~counter~0 42)} assume !!(0 != ~r~0); {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:27,831 INFO L284 TraceCheckUtils]: 365: Hoare quadruple {7763#true} {8968#(<= ~counter~0 42)} #63#return; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:27,831 INFO L290 TraceCheckUtils]: 364: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,831 INFO L290 TraceCheckUtils]: 363: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,831 INFO L290 TraceCheckUtils]: 362: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,831 INFO L272 TraceCheckUtils]: 361: Hoare triple {8968#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,832 INFO L290 TraceCheckUtils]: 360: Hoare triple {8968#(<= ~counter~0 42)} assume !!(#t~post6 < 50);havoc #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:27,832 INFO L290 TraceCheckUtils]: 359: Hoare triple {8940#(<= ~counter~0 41)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8968#(<= ~counter~0 42)} is VALID [2022-04-14 16:17:27,832 INFO L290 TraceCheckUtils]: 358: Hoare triple {8940#(<= ~counter~0 41)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:27,832 INFO L290 TraceCheckUtils]: 357: Hoare triple {8940#(<= ~counter~0 41)} assume !!(0 != ~r~0); {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:27,833 INFO L284 TraceCheckUtils]: 356: Hoare quadruple {7763#true} {8940#(<= ~counter~0 41)} #63#return; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:27,833 INFO L290 TraceCheckUtils]: 355: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,833 INFO L290 TraceCheckUtils]: 354: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,833 INFO L290 TraceCheckUtils]: 353: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,833 INFO L272 TraceCheckUtils]: 352: Hoare triple {8940#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,833 INFO L290 TraceCheckUtils]: 351: Hoare triple {8940#(<= ~counter~0 41)} assume !!(#t~post6 < 50);havoc #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:27,834 INFO L290 TraceCheckUtils]: 350: Hoare triple {8912#(<= ~counter~0 40)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8940#(<= ~counter~0 41)} is VALID [2022-04-14 16:17:27,834 INFO L290 TraceCheckUtils]: 349: Hoare triple {8912#(<= ~counter~0 40)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:27,834 INFO L290 TraceCheckUtils]: 348: Hoare triple {8912#(<= ~counter~0 40)} assume !!(0 != ~r~0); {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:27,835 INFO L284 TraceCheckUtils]: 347: Hoare quadruple {7763#true} {8912#(<= ~counter~0 40)} #63#return; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:27,835 INFO L290 TraceCheckUtils]: 346: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,835 INFO L290 TraceCheckUtils]: 345: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,835 INFO L290 TraceCheckUtils]: 344: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,835 INFO L272 TraceCheckUtils]: 343: Hoare triple {8912#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,835 INFO L290 TraceCheckUtils]: 342: Hoare triple {8912#(<= ~counter~0 40)} assume !!(#t~post6 < 50);havoc #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:27,835 INFO L290 TraceCheckUtils]: 341: Hoare triple {8884#(<= ~counter~0 39)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8912#(<= ~counter~0 40)} is VALID [2022-04-14 16:17:27,836 INFO L290 TraceCheckUtils]: 340: Hoare triple {8884#(<= ~counter~0 39)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:27,836 INFO L290 TraceCheckUtils]: 339: Hoare triple {8884#(<= ~counter~0 39)} assume !!(0 != ~r~0); {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:27,836 INFO L284 TraceCheckUtils]: 338: Hoare quadruple {7763#true} {8884#(<= ~counter~0 39)} #63#return; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:27,836 INFO L290 TraceCheckUtils]: 337: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,836 INFO L290 TraceCheckUtils]: 336: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,836 INFO L290 TraceCheckUtils]: 335: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,836 INFO L272 TraceCheckUtils]: 334: Hoare triple {8884#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,837 INFO L290 TraceCheckUtils]: 333: Hoare triple {8884#(<= ~counter~0 39)} assume !!(#t~post6 < 50);havoc #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:27,837 INFO L290 TraceCheckUtils]: 332: Hoare triple {8856#(<= ~counter~0 38)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8884#(<= ~counter~0 39)} is VALID [2022-04-14 16:17:27,837 INFO L290 TraceCheckUtils]: 331: Hoare triple {8856#(<= ~counter~0 38)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:27,837 INFO L290 TraceCheckUtils]: 330: Hoare triple {8856#(<= ~counter~0 38)} assume !!(0 != ~r~0); {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:27,838 INFO L284 TraceCheckUtils]: 329: Hoare quadruple {7763#true} {8856#(<= ~counter~0 38)} #63#return; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:27,838 INFO L290 TraceCheckUtils]: 328: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,838 INFO L290 TraceCheckUtils]: 327: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,838 INFO L290 TraceCheckUtils]: 326: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,838 INFO L272 TraceCheckUtils]: 325: Hoare triple {8856#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,838 INFO L290 TraceCheckUtils]: 324: Hoare triple {8856#(<= ~counter~0 38)} assume !!(#t~post6 < 50);havoc #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:27,839 INFO L290 TraceCheckUtils]: 323: Hoare triple {8828#(<= ~counter~0 37)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8856#(<= ~counter~0 38)} is VALID [2022-04-14 16:17:27,839 INFO L290 TraceCheckUtils]: 322: Hoare triple {8828#(<= ~counter~0 37)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:27,839 INFO L290 TraceCheckUtils]: 321: Hoare triple {8828#(<= ~counter~0 37)} assume !!(0 != ~r~0); {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:27,840 INFO L284 TraceCheckUtils]: 320: Hoare quadruple {7763#true} {8828#(<= ~counter~0 37)} #63#return; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:27,840 INFO L290 TraceCheckUtils]: 319: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,840 INFO L290 TraceCheckUtils]: 318: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,840 INFO L290 TraceCheckUtils]: 317: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,840 INFO L272 TraceCheckUtils]: 316: Hoare triple {8828#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,840 INFO L290 TraceCheckUtils]: 315: Hoare triple {8828#(<= ~counter~0 37)} assume !!(#t~post6 < 50);havoc #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:27,840 INFO L290 TraceCheckUtils]: 314: Hoare triple {8800#(<= ~counter~0 36)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8828#(<= ~counter~0 37)} is VALID [2022-04-14 16:17:27,841 INFO L290 TraceCheckUtils]: 313: Hoare triple {8800#(<= ~counter~0 36)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:27,841 INFO L290 TraceCheckUtils]: 312: Hoare triple {8800#(<= ~counter~0 36)} assume !!(0 != ~r~0); {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:27,842 INFO L284 TraceCheckUtils]: 311: Hoare quadruple {7763#true} {8800#(<= ~counter~0 36)} #63#return; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:27,842 INFO L290 TraceCheckUtils]: 310: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,842 INFO L290 TraceCheckUtils]: 309: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,842 INFO L290 TraceCheckUtils]: 308: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,842 INFO L272 TraceCheckUtils]: 307: Hoare triple {8800#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,842 INFO L290 TraceCheckUtils]: 306: Hoare triple {8800#(<= ~counter~0 36)} assume !!(#t~post6 < 50);havoc #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:27,843 INFO L290 TraceCheckUtils]: 305: Hoare triple {8772#(<= ~counter~0 35)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8800#(<= ~counter~0 36)} is VALID [2022-04-14 16:17:27,843 INFO L290 TraceCheckUtils]: 304: Hoare triple {8772#(<= ~counter~0 35)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:27,843 INFO L290 TraceCheckUtils]: 303: Hoare triple {8772#(<= ~counter~0 35)} assume !!(0 != ~r~0); {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:27,843 INFO L284 TraceCheckUtils]: 302: Hoare quadruple {7763#true} {8772#(<= ~counter~0 35)} #63#return; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:27,843 INFO L290 TraceCheckUtils]: 301: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,844 INFO L290 TraceCheckUtils]: 300: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,844 INFO L290 TraceCheckUtils]: 299: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,844 INFO L272 TraceCheckUtils]: 298: Hoare triple {8772#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,844 INFO L290 TraceCheckUtils]: 297: Hoare triple {8772#(<= ~counter~0 35)} assume !!(#t~post6 < 50);havoc #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:27,844 INFO L290 TraceCheckUtils]: 296: Hoare triple {8744#(<= ~counter~0 34)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8772#(<= ~counter~0 35)} is VALID [2022-04-14 16:17:27,844 INFO L290 TraceCheckUtils]: 295: Hoare triple {8744#(<= ~counter~0 34)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:27,845 INFO L290 TraceCheckUtils]: 294: Hoare triple {8744#(<= ~counter~0 34)} assume !!(0 != ~r~0); {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:27,845 INFO L284 TraceCheckUtils]: 293: Hoare quadruple {7763#true} {8744#(<= ~counter~0 34)} #63#return; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:27,845 INFO L290 TraceCheckUtils]: 292: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,845 INFO L290 TraceCheckUtils]: 291: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,845 INFO L290 TraceCheckUtils]: 290: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,845 INFO L272 TraceCheckUtils]: 289: Hoare triple {8744#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,846 INFO L290 TraceCheckUtils]: 288: Hoare triple {8744#(<= ~counter~0 34)} assume !!(#t~post6 < 50);havoc #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:27,846 INFO L290 TraceCheckUtils]: 287: Hoare triple {8716#(<= ~counter~0 33)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8744#(<= ~counter~0 34)} is VALID [2022-04-14 16:17:27,846 INFO L290 TraceCheckUtils]: 286: Hoare triple {8716#(<= ~counter~0 33)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:27,846 INFO L290 TraceCheckUtils]: 285: Hoare triple {8716#(<= ~counter~0 33)} assume !!(0 != ~r~0); {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:27,847 INFO L284 TraceCheckUtils]: 284: Hoare quadruple {7763#true} {8716#(<= ~counter~0 33)} #63#return; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:27,847 INFO L290 TraceCheckUtils]: 283: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,847 INFO L290 TraceCheckUtils]: 282: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,847 INFO L290 TraceCheckUtils]: 281: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,847 INFO L272 TraceCheckUtils]: 280: Hoare triple {8716#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,847 INFO L290 TraceCheckUtils]: 279: Hoare triple {8716#(<= ~counter~0 33)} assume !!(#t~post6 < 50);havoc #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:27,848 INFO L290 TraceCheckUtils]: 278: Hoare triple {8688#(<= ~counter~0 32)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8716#(<= ~counter~0 33)} is VALID [2022-04-14 16:17:27,848 INFO L290 TraceCheckUtils]: 277: Hoare triple {8688#(<= ~counter~0 32)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:27,848 INFO L290 TraceCheckUtils]: 276: Hoare triple {8688#(<= ~counter~0 32)} assume !!(0 != ~r~0); {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:27,848 INFO L284 TraceCheckUtils]: 275: Hoare quadruple {7763#true} {8688#(<= ~counter~0 32)} #63#return; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:27,848 INFO L290 TraceCheckUtils]: 274: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,849 INFO L290 TraceCheckUtils]: 273: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,849 INFO L290 TraceCheckUtils]: 272: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,849 INFO L272 TraceCheckUtils]: 271: Hoare triple {8688#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,849 INFO L290 TraceCheckUtils]: 270: Hoare triple {8688#(<= ~counter~0 32)} assume !!(#t~post6 < 50);havoc #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:27,849 INFO L290 TraceCheckUtils]: 269: Hoare triple {8660#(<= ~counter~0 31)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8688#(<= ~counter~0 32)} is VALID [2022-04-14 16:17:27,849 INFO L290 TraceCheckUtils]: 268: Hoare triple {8660#(<= ~counter~0 31)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:27,850 INFO L290 TraceCheckUtils]: 267: Hoare triple {8660#(<= ~counter~0 31)} assume !!(0 != ~r~0); {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:27,850 INFO L284 TraceCheckUtils]: 266: Hoare quadruple {7763#true} {8660#(<= ~counter~0 31)} #63#return; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:27,850 INFO L290 TraceCheckUtils]: 265: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,850 INFO L290 TraceCheckUtils]: 264: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,850 INFO L290 TraceCheckUtils]: 263: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,850 INFO L272 TraceCheckUtils]: 262: Hoare triple {8660#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,850 INFO L290 TraceCheckUtils]: 261: Hoare triple {8660#(<= ~counter~0 31)} assume !!(#t~post6 < 50);havoc #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:27,851 INFO L290 TraceCheckUtils]: 260: Hoare triple {8632#(<= ~counter~0 30)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8660#(<= ~counter~0 31)} is VALID [2022-04-14 16:17:27,851 INFO L290 TraceCheckUtils]: 259: Hoare triple {8632#(<= ~counter~0 30)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:27,851 INFO L290 TraceCheckUtils]: 258: Hoare triple {8632#(<= ~counter~0 30)} assume !!(0 != ~r~0); {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:27,852 INFO L284 TraceCheckUtils]: 257: Hoare quadruple {7763#true} {8632#(<= ~counter~0 30)} #63#return; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:27,852 INFO L290 TraceCheckUtils]: 256: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,852 INFO L290 TraceCheckUtils]: 255: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,852 INFO L290 TraceCheckUtils]: 254: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,852 INFO L272 TraceCheckUtils]: 253: Hoare triple {8632#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,853 INFO L290 TraceCheckUtils]: 252: Hoare triple {8632#(<= ~counter~0 30)} assume !!(#t~post6 < 50);havoc #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:27,854 INFO L290 TraceCheckUtils]: 251: Hoare triple {8604#(<= ~counter~0 29)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8632#(<= ~counter~0 30)} is VALID [2022-04-14 16:17:27,854 INFO L290 TraceCheckUtils]: 250: Hoare triple {8604#(<= ~counter~0 29)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:27,854 INFO L290 TraceCheckUtils]: 249: Hoare triple {8604#(<= ~counter~0 29)} assume !!(0 != ~r~0); {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:27,855 INFO L284 TraceCheckUtils]: 248: Hoare quadruple {7763#true} {8604#(<= ~counter~0 29)} #63#return; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:27,855 INFO L290 TraceCheckUtils]: 247: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,855 INFO L290 TraceCheckUtils]: 246: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,855 INFO L290 TraceCheckUtils]: 245: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,855 INFO L272 TraceCheckUtils]: 244: Hoare triple {8604#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,855 INFO L290 TraceCheckUtils]: 243: Hoare triple {8604#(<= ~counter~0 29)} assume !!(#t~post6 < 50);havoc #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:27,856 INFO L290 TraceCheckUtils]: 242: Hoare triple {8576#(<= ~counter~0 28)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8604#(<= ~counter~0 29)} is VALID [2022-04-14 16:17:27,856 INFO L290 TraceCheckUtils]: 241: Hoare triple {8576#(<= ~counter~0 28)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:27,856 INFO L290 TraceCheckUtils]: 240: Hoare triple {8576#(<= ~counter~0 28)} assume !!(0 != ~r~0); {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:27,856 INFO L284 TraceCheckUtils]: 239: Hoare quadruple {7763#true} {8576#(<= ~counter~0 28)} #63#return; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:27,856 INFO L290 TraceCheckUtils]: 238: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,857 INFO L290 TraceCheckUtils]: 237: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,857 INFO L290 TraceCheckUtils]: 236: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,857 INFO L272 TraceCheckUtils]: 235: Hoare triple {8576#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,857 INFO L290 TraceCheckUtils]: 234: Hoare triple {8576#(<= ~counter~0 28)} assume !!(#t~post6 < 50);havoc #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:27,857 INFO L290 TraceCheckUtils]: 233: Hoare triple {8548#(<= ~counter~0 27)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8576#(<= ~counter~0 28)} is VALID [2022-04-14 16:17:27,857 INFO L290 TraceCheckUtils]: 232: Hoare triple {8548#(<= ~counter~0 27)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:27,858 INFO L290 TraceCheckUtils]: 231: Hoare triple {8548#(<= ~counter~0 27)} assume !!(0 != ~r~0); {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:27,858 INFO L284 TraceCheckUtils]: 230: Hoare quadruple {7763#true} {8548#(<= ~counter~0 27)} #63#return; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:27,858 INFO L290 TraceCheckUtils]: 229: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,858 INFO L290 TraceCheckUtils]: 228: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,858 INFO L290 TraceCheckUtils]: 227: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,858 INFO L272 TraceCheckUtils]: 226: Hoare triple {8548#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,859 INFO L290 TraceCheckUtils]: 225: Hoare triple {8548#(<= ~counter~0 27)} assume !!(#t~post6 < 50);havoc #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:27,859 INFO L290 TraceCheckUtils]: 224: Hoare triple {8520#(<= ~counter~0 26)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8548#(<= ~counter~0 27)} is VALID [2022-04-14 16:17:27,859 INFO L290 TraceCheckUtils]: 223: Hoare triple {8520#(<= ~counter~0 26)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:27,859 INFO L290 TraceCheckUtils]: 222: Hoare triple {8520#(<= ~counter~0 26)} assume !!(0 != ~r~0); {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:27,860 INFO L284 TraceCheckUtils]: 221: Hoare quadruple {7763#true} {8520#(<= ~counter~0 26)} #63#return; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:27,860 INFO L290 TraceCheckUtils]: 220: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,860 INFO L290 TraceCheckUtils]: 219: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,860 INFO L290 TraceCheckUtils]: 218: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,860 INFO L272 TraceCheckUtils]: 217: Hoare triple {8520#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,860 INFO L290 TraceCheckUtils]: 216: Hoare triple {8520#(<= ~counter~0 26)} assume !!(#t~post6 < 50);havoc #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:27,861 INFO L290 TraceCheckUtils]: 215: Hoare triple {8492#(<= ~counter~0 25)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8520#(<= ~counter~0 26)} is VALID [2022-04-14 16:17:27,861 INFO L290 TraceCheckUtils]: 214: Hoare triple {8492#(<= ~counter~0 25)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:27,861 INFO L290 TraceCheckUtils]: 213: Hoare triple {8492#(<= ~counter~0 25)} assume !!(0 != ~r~0); {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:27,861 INFO L284 TraceCheckUtils]: 212: Hoare quadruple {7763#true} {8492#(<= ~counter~0 25)} #63#return; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:27,861 INFO L290 TraceCheckUtils]: 211: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,861 INFO L290 TraceCheckUtils]: 210: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,862 INFO L290 TraceCheckUtils]: 209: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,862 INFO L272 TraceCheckUtils]: 208: Hoare triple {8492#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,862 INFO L290 TraceCheckUtils]: 207: Hoare triple {8492#(<= ~counter~0 25)} assume !!(#t~post6 < 50);havoc #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:27,862 INFO L290 TraceCheckUtils]: 206: Hoare triple {8464#(<= ~counter~0 24)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8492#(<= ~counter~0 25)} is VALID [2022-04-14 16:17:27,862 INFO L290 TraceCheckUtils]: 205: Hoare triple {8464#(<= ~counter~0 24)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:27,863 INFO L290 TraceCheckUtils]: 204: Hoare triple {8464#(<= ~counter~0 24)} assume !!(0 != ~r~0); {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:27,863 INFO L284 TraceCheckUtils]: 203: Hoare quadruple {7763#true} {8464#(<= ~counter~0 24)} #63#return; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:27,863 INFO L290 TraceCheckUtils]: 202: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,863 INFO L290 TraceCheckUtils]: 201: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,863 INFO L290 TraceCheckUtils]: 200: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,863 INFO L272 TraceCheckUtils]: 199: Hoare triple {8464#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,864 INFO L290 TraceCheckUtils]: 198: Hoare triple {8464#(<= ~counter~0 24)} assume !!(#t~post6 < 50);havoc #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:27,864 INFO L290 TraceCheckUtils]: 197: Hoare triple {8436#(<= ~counter~0 23)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8464#(<= ~counter~0 24)} is VALID [2022-04-14 16:17:27,864 INFO L290 TraceCheckUtils]: 196: Hoare triple {8436#(<= ~counter~0 23)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:27,864 INFO L290 TraceCheckUtils]: 195: Hoare triple {8436#(<= ~counter~0 23)} assume !!(0 != ~r~0); {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:27,865 INFO L284 TraceCheckUtils]: 194: Hoare quadruple {7763#true} {8436#(<= ~counter~0 23)} #63#return; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:27,865 INFO L290 TraceCheckUtils]: 193: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,865 INFO L290 TraceCheckUtils]: 192: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,865 INFO L290 TraceCheckUtils]: 191: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,865 INFO L272 TraceCheckUtils]: 190: Hoare triple {8436#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,865 INFO L290 TraceCheckUtils]: 189: Hoare triple {8436#(<= ~counter~0 23)} assume !!(#t~post6 < 50);havoc #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:27,866 INFO L290 TraceCheckUtils]: 188: Hoare triple {8408#(<= ~counter~0 22)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8436#(<= ~counter~0 23)} is VALID [2022-04-14 16:17:27,866 INFO L290 TraceCheckUtils]: 187: Hoare triple {8408#(<= ~counter~0 22)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:27,866 INFO L290 TraceCheckUtils]: 186: Hoare triple {8408#(<= ~counter~0 22)} assume !!(0 != ~r~0); {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:27,866 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {7763#true} {8408#(<= ~counter~0 22)} #63#return; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:27,866 INFO L290 TraceCheckUtils]: 184: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,866 INFO L290 TraceCheckUtils]: 183: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,867 INFO L290 TraceCheckUtils]: 182: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,867 INFO L272 TraceCheckUtils]: 181: Hoare triple {8408#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,867 INFO L290 TraceCheckUtils]: 180: Hoare triple {8408#(<= ~counter~0 22)} assume !!(#t~post6 < 50);havoc #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:27,867 INFO L290 TraceCheckUtils]: 179: Hoare triple {8380#(<= ~counter~0 21)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8408#(<= ~counter~0 22)} is VALID [2022-04-14 16:17:27,868 INFO L290 TraceCheckUtils]: 178: Hoare triple {8380#(<= ~counter~0 21)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:27,868 INFO L290 TraceCheckUtils]: 177: Hoare triple {8380#(<= ~counter~0 21)} assume !!(0 != ~r~0); {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:27,869 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {7763#true} {8380#(<= ~counter~0 21)} #63#return; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:27,869 INFO L290 TraceCheckUtils]: 175: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,869 INFO L290 TraceCheckUtils]: 174: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,869 INFO L290 TraceCheckUtils]: 173: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,870 INFO L272 TraceCheckUtils]: 172: Hoare triple {8380#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,870 INFO L290 TraceCheckUtils]: 171: Hoare triple {8380#(<= ~counter~0 21)} assume !!(#t~post6 < 50);havoc #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:27,870 INFO L290 TraceCheckUtils]: 170: Hoare triple {8352#(<= ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8380#(<= ~counter~0 21)} is VALID [2022-04-14 16:17:27,871 INFO L290 TraceCheckUtils]: 169: Hoare triple {8352#(<= ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:27,871 INFO L290 TraceCheckUtils]: 168: Hoare triple {8352#(<= ~counter~0 20)} assume !!(0 != ~r~0); {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:27,872 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {7763#true} {8352#(<= ~counter~0 20)} #63#return; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:27,872 INFO L290 TraceCheckUtils]: 166: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,872 INFO L290 TraceCheckUtils]: 165: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,872 INFO L290 TraceCheckUtils]: 164: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,872 INFO L272 TraceCheckUtils]: 163: Hoare triple {8352#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,872 INFO L290 TraceCheckUtils]: 162: Hoare triple {8352#(<= ~counter~0 20)} assume !!(#t~post6 < 50);havoc #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:27,873 INFO L290 TraceCheckUtils]: 161: Hoare triple {8324#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8352#(<= ~counter~0 20)} is VALID [2022-04-14 16:17:27,873 INFO L290 TraceCheckUtils]: 160: Hoare triple {8324#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:27,873 INFO L290 TraceCheckUtils]: 159: Hoare triple {8324#(<= ~counter~0 19)} assume !!(0 != ~r~0); {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:27,874 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {7763#true} {8324#(<= ~counter~0 19)} #63#return; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:27,874 INFO L290 TraceCheckUtils]: 157: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,874 INFO L290 TraceCheckUtils]: 156: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,874 INFO L290 TraceCheckUtils]: 155: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,874 INFO L272 TraceCheckUtils]: 154: Hoare triple {8324#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,875 INFO L290 TraceCheckUtils]: 153: Hoare triple {8324#(<= ~counter~0 19)} assume !!(#t~post6 < 50);havoc #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:27,875 INFO L290 TraceCheckUtils]: 152: Hoare triple {8296#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8324#(<= ~counter~0 19)} is VALID [2022-04-14 16:17:27,875 INFO L290 TraceCheckUtils]: 151: Hoare triple {8296#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:27,876 INFO L290 TraceCheckUtils]: 150: Hoare triple {8296#(<= ~counter~0 18)} assume !!(0 != ~r~0); {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:27,876 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {7763#true} {8296#(<= ~counter~0 18)} #63#return; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:27,876 INFO L290 TraceCheckUtils]: 148: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,876 INFO L290 TraceCheckUtils]: 147: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,877 INFO L290 TraceCheckUtils]: 146: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,877 INFO L272 TraceCheckUtils]: 145: Hoare triple {8296#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,877 INFO L290 TraceCheckUtils]: 144: Hoare triple {8296#(<= ~counter~0 18)} assume !!(#t~post6 < 50);havoc #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:27,877 INFO L290 TraceCheckUtils]: 143: Hoare triple {8268#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8296#(<= ~counter~0 18)} is VALID [2022-04-14 16:17:27,878 INFO L290 TraceCheckUtils]: 142: Hoare triple {8268#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:27,878 INFO L290 TraceCheckUtils]: 141: Hoare triple {8268#(<= ~counter~0 17)} assume !!(0 != ~r~0); {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:27,879 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {7763#true} {8268#(<= ~counter~0 17)} #63#return; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:27,879 INFO L290 TraceCheckUtils]: 139: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,879 INFO L290 TraceCheckUtils]: 138: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,879 INFO L290 TraceCheckUtils]: 137: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,879 INFO L272 TraceCheckUtils]: 136: Hoare triple {8268#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,879 INFO L290 TraceCheckUtils]: 135: Hoare triple {8268#(<= ~counter~0 17)} assume !!(#t~post6 < 50);havoc #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:27,880 INFO L290 TraceCheckUtils]: 134: Hoare triple {8240#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8268#(<= ~counter~0 17)} is VALID [2022-04-14 16:17:27,880 INFO L290 TraceCheckUtils]: 133: Hoare triple {8240#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:27,880 INFO L290 TraceCheckUtils]: 132: Hoare triple {8240#(<= ~counter~0 16)} assume !!(0 != ~r~0); {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:27,881 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {7763#true} {8240#(<= ~counter~0 16)} #63#return; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:27,881 INFO L290 TraceCheckUtils]: 130: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,881 INFO L290 TraceCheckUtils]: 129: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,881 INFO L290 TraceCheckUtils]: 128: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,881 INFO L272 TraceCheckUtils]: 127: Hoare triple {8240#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,882 INFO L290 TraceCheckUtils]: 126: Hoare triple {8240#(<= ~counter~0 16)} assume !!(#t~post6 < 50);havoc #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:27,882 INFO L290 TraceCheckUtils]: 125: Hoare triple {8212#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8240#(<= ~counter~0 16)} is VALID [2022-04-14 16:17:27,882 INFO L290 TraceCheckUtils]: 124: Hoare triple {8212#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:27,883 INFO L290 TraceCheckUtils]: 123: Hoare triple {8212#(<= ~counter~0 15)} assume !!(0 != ~r~0); {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:27,883 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {7763#true} {8212#(<= ~counter~0 15)} #63#return; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:27,883 INFO L290 TraceCheckUtils]: 121: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,883 INFO L290 TraceCheckUtils]: 120: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,883 INFO L290 TraceCheckUtils]: 119: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,884 INFO L272 TraceCheckUtils]: 118: Hoare triple {8212#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,884 INFO L290 TraceCheckUtils]: 117: Hoare triple {8212#(<= ~counter~0 15)} assume !!(#t~post6 < 50);havoc #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:27,884 INFO L290 TraceCheckUtils]: 116: Hoare triple {8184#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8212#(<= ~counter~0 15)} is VALID [2022-04-14 16:17:27,885 INFO L290 TraceCheckUtils]: 115: Hoare triple {8184#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:27,885 INFO L290 TraceCheckUtils]: 114: Hoare triple {8184#(<= ~counter~0 14)} assume !!(0 != ~r~0); {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:27,885 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {7763#true} {8184#(<= ~counter~0 14)} #63#return; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:27,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,885 INFO L290 TraceCheckUtils]: 111: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,886 INFO L290 TraceCheckUtils]: 110: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,886 INFO L272 TraceCheckUtils]: 109: Hoare triple {8184#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,886 INFO L290 TraceCheckUtils]: 108: Hoare triple {8184#(<= ~counter~0 14)} assume !!(#t~post6 < 50);havoc #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:27,886 INFO L290 TraceCheckUtils]: 107: Hoare triple {8156#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8184#(<= ~counter~0 14)} is VALID [2022-04-14 16:17:27,887 INFO L290 TraceCheckUtils]: 106: Hoare triple {8156#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:27,887 INFO L290 TraceCheckUtils]: 105: Hoare triple {8156#(<= ~counter~0 13)} assume !!(0 != ~r~0); {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:27,887 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {7763#true} {8156#(<= ~counter~0 13)} #63#return; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:27,888 INFO L290 TraceCheckUtils]: 103: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,888 INFO L290 TraceCheckUtils]: 102: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,888 INFO L290 TraceCheckUtils]: 101: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,888 INFO L272 TraceCheckUtils]: 100: Hoare triple {8156#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,888 INFO L290 TraceCheckUtils]: 99: Hoare triple {8156#(<= ~counter~0 13)} assume !!(#t~post6 < 50);havoc #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:27,888 INFO L290 TraceCheckUtils]: 98: Hoare triple {8128#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8156#(<= ~counter~0 13)} is VALID [2022-04-14 16:17:27,889 INFO L290 TraceCheckUtils]: 97: Hoare triple {8128#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:27,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {8128#(<= ~counter~0 12)} assume !!(0 != ~r~0); {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:27,890 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7763#true} {8128#(<= ~counter~0 12)} #63#return; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:27,890 INFO L290 TraceCheckUtils]: 94: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,890 INFO L290 TraceCheckUtils]: 93: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,890 INFO L290 TraceCheckUtils]: 92: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,890 INFO L272 TraceCheckUtils]: 91: Hoare triple {8128#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,890 INFO L290 TraceCheckUtils]: 90: Hoare triple {8128#(<= ~counter~0 12)} assume !!(#t~post6 < 50);havoc #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:27,891 INFO L290 TraceCheckUtils]: 89: Hoare triple {8100#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8128#(<= ~counter~0 12)} is VALID [2022-04-14 16:17:27,891 INFO L290 TraceCheckUtils]: 88: Hoare triple {8100#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:27,891 INFO L290 TraceCheckUtils]: 87: Hoare triple {8100#(<= ~counter~0 11)} assume !!(0 != ~r~0); {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:27,892 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7763#true} {8100#(<= ~counter~0 11)} #63#return; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:27,892 INFO L290 TraceCheckUtils]: 85: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,892 INFO L290 TraceCheckUtils]: 83: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,892 INFO L272 TraceCheckUtils]: 82: Hoare triple {8100#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,892 INFO L290 TraceCheckUtils]: 81: Hoare triple {8100#(<= ~counter~0 11)} assume !!(#t~post6 < 50);havoc #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:27,893 INFO L290 TraceCheckUtils]: 80: Hoare triple {8072#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8100#(<= ~counter~0 11)} is VALID [2022-04-14 16:17:27,893 INFO L290 TraceCheckUtils]: 79: Hoare triple {8072#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:27,893 INFO L290 TraceCheckUtils]: 78: Hoare triple {8072#(<= ~counter~0 10)} assume !!(0 != ~r~0); {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:27,894 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7763#true} {8072#(<= ~counter~0 10)} #63#return; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:27,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,894 INFO L272 TraceCheckUtils]: 73: Hoare triple {8072#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {8072#(<= ~counter~0 10)} assume !!(#t~post6 < 50);havoc #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:27,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {8044#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8072#(<= ~counter~0 10)} is VALID [2022-04-14 16:17:27,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {8044#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:27,895 INFO L290 TraceCheckUtils]: 69: Hoare triple {8044#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:27,896 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7763#true} {8044#(<= ~counter~0 9)} #63#return; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:27,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,896 INFO L272 TraceCheckUtils]: 64: Hoare triple {8044#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,896 INFO L290 TraceCheckUtils]: 63: Hoare triple {8044#(<= ~counter~0 9)} assume !!(#t~post6 < 50);havoc #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:27,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {8016#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8044#(<= ~counter~0 9)} is VALID [2022-04-14 16:17:27,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {8016#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:27,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {8016#(<= ~counter~0 8)} assume !!(0 != ~r~0); {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:27,898 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7763#true} {8016#(<= ~counter~0 8)} #63#return; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:27,898 INFO L290 TraceCheckUtils]: 58: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,898 INFO L290 TraceCheckUtils]: 57: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,898 INFO L290 TraceCheckUtils]: 56: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,898 INFO L272 TraceCheckUtils]: 55: Hoare triple {8016#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,898 INFO L290 TraceCheckUtils]: 54: Hoare triple {8016#(<= ~counter~0 8)} assume !!(#t~post6 < 50);havoc #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:27,899 INFO L290 TraceCheckUtils]: 53: Hoare triple {7988#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8016#(<= ~counter~0 8)} is VALID [2022-04-14 16:17:27,899 INFO L290 TraceCheckUtils]: 52: Hoare triple {7988#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:27,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {7988#(<= ~counter~0 7)} assume !!(0 != ~r~0); {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:27,900 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7763#true} {7988#(<= ~counter~0 7)} #63#return; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:27,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,900 INFO L290 TraceCheckUtils]: 48: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,900 INFO L290 TraceCheckUtils]: 47: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,900 INFO L272 TraceCheckUtils]: 46: Hoare triple {7988#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {7988#(<= ~counter~0 7)} assume !!(#t~post6 < 50);havoc #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:27,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {7960#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7988#(<= ~counter~0 7)} is VALID [2022-04-14 16:17:27,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {7960#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:27,902 INFO L290 TraceCheckUtils]: 42: Hoare triple {7960#(<= ~counter~0 6)} assume !!(0 != ~r~0); {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:27,902 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7763#true} {7960#(<= ~counter~0 6)} #63#return; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:27,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,902 INFO L290 TraceCheckUtils]: 39: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,902 INFO L290 TraceCheckUtils]: 38: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,902 INFO L272 TraceCheckUtils]: 37: Hoare triple {7960#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {7960#(<= ~counter~0 6)} assume !!(#t~post6 < 50);havoc #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:27,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {7932#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7960#(<= ~counter~0 6)} is VALID [2022-04-14 16:17:27,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {7932#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:27,904 INFO L290 TraceCheckUtils]: 33: Hoare triple {7932#(<= ~counter~0 5)} assume !!(0 != ~r~0); {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:27,904 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7763#true} {7932#(<= ~counter~0 5)} #63#return; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:27,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,904 INFO L272 TraceCheckUtils]: 28: Hoare triple {7932#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {7932#(<= ~counter~0 5)} assume !!(#t~post6 < 50);havoc #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:27,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {7904#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7932#(<= ~counter~0 5)} is VALID [2022-04-14 16:17:27,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {7904#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:27,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {7904#(<= ~counter~0 4)} assume !!(0 != ~r~0); {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:27,906 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7763#true} {7904#(<= ~counter~0 4)} #63#return; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:27,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,906 INFO L272 TraceCheckUtils]: 19: Hoare triple {7904#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {7904#(<= ~counter~0 4)} assume !!(#t~post6 < 50);havoc #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:27,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {7876#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7904#(<= ~counter~0 4)} is VALID [2022-04-14 16:17:27,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {7876#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,907 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7763#true} {7876#(<= ~counter~0 3)} #61#return; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {7876#(<= ~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)); {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7763#true} {7876#(<= ~counter~0 3)} #59#return; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {7763#true} assume true; {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {7763#true} assume !(0 == ~cond); {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {7763#true} ~cond := #in~cond; {7763#true} is VALID [2022-04-14 16:17:27,908 INFO L272 TraceCheckUtils]: 6: Hoare triple {7876#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7763#true} is VALID [2022-04-14 16:17:27,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {7876#(<= ~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; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {7876#(<= ~counter~0 3)} call #t~ret7 := main(); {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7876#(<= ~counter~0 3)} {7763#true} #67#return; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {7876#(<= ~counter~0 3)} assume true; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {7763#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; {7876#(<= ~counter~0 3)} is VALID [2022-04-14 16:17:27,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {7763#true} call ULTIMATE.init(); {7763#true} is VALID [2022-04-14 16:17:27,913 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-14 16:17:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:17:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082181758] [2022-04-14 16:17:27,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:17:27,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411604027] [2022-04-14 16:17:27,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411604027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:17:27,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:17:27,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 54 [2022-04-14 16:17:27,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415139383] [2022-04-14 16:17:27,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:17:27,917 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